Positioning with disjoint bandwidth segments

ABSTRACT

Disclosed are techniques for wireless communication. In an aspect, a network node receives a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other, and determines a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present Application for Patent claims the benefit of U.S. Provisional Application No. 63/035,444, entitled “POSITIONING WITH DISJOINT BANDWIDTH SEGMENTS,” filed Jun. 5, 2020, assigned to the assignee hereof, and expressly incorporated herein by reference in its entirety.

BACKGROUND OF THE DISCLOSURE 1. Field of the Disclosure

Aspects of the disclosure relate generally to wireless positioning and the like.

2. Description of the Related Art

Wireless communication systems have developed through various generations, including a first-generation analog wireless phone service (1G), a second-generation (2G) digital wireless phone service (including interim 2.5G and 2.75G networks), a third-generation (3G) high speed data, Internet-capable wireless service and a fourth-generation (4G) service (e.g., Long Term Evolution (LTE) or WiMax). There are presently many different types of wireless communication systems in use, including cellular and personal communications service (PCS) systems. Examples of known cellular systems include the cellular analog advanced mobile phone system (AMPS), and digital cellular systems based on code division multiple access (CDMA), frequency division multiple access (FDMA), time division multiple access (TDMA), the Global System for Mobile communications (GSM), etc.

A fifth generation (5G) wireless standard, referred to as New Radio (NR), calls for higher data transfer speeds, greater numbers of connections, and better coverage, among other improvements. The 5G standard, according to the Next Generation Mobile Networks Alliance, is designed to provide data rates of several tens of megabits per second to each of tens of thousands of users, with 1 gigabit per second to tens of workers on an office floor. Several hundreds of thousands of simultaneous connections should be supported in order to support large sensor deployments. Consequently, the spectral efficiency of 5G mobile communications should be significantly enhanced compared to the current 4G standard. Furthermore, signaling efficiencies should be enhanced and latency should be substantially reduced compared to current standards.

SUMMARY

The following presents a simplified summary relating to one or more aspects disclosed herein. Thus, the following summary should not be considered an extensive overview relating to all contemplated aspects, nor should the following summary be considered to identify key or critical elements relating to all contemplated aspects or to delineate the scope associated with any particular aspect. Accordingly, the following summary has the sole purpose to present certain concepts relating to one or more aspects relating to the mechanisms disclosed herein in a simplified form to precede the detailed description presented below.

In an aspect, a method of wireless communication performed by a network node includes receiving a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determining a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.

In an aspect, a network node includes a memory; at least one transceiver; and at least one processor communicatively coupled to the memory and the at least one transceiver, the at least one processor configured to: receive, via the at least one transceiver, a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determine a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.

In an aspect, a network node includes means for receiving a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and means for determining a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.

In an aspect, a non-transitory computer-readable medium storing computer-executable instructions that, when executed by a network node, cause the network node to: receive a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determine a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.

Other objects and advantages associated with the aspects disclosed herein will be apparent to those skilled in the art based on the accompanying drawings and detailed description.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings are presented to aid in the description of various aspects of the disclosure and are provided solely for illustration of the aspects and not limitation thereof.

FIG. 1 illustrates an example wireless communications system, according to aspects of the disclosure.

FIGS. 2A and 2B illustrate example wireless network structures, according to aspects of the disclosure.

FIGS. 3A, 3B, and 3C are simplified block diagrams of several sample aspects of components that may be employed in a user equipment (UE), a base station, and a network entity, respectively, and configured to support communications as taught herein.

FIG. 4 is a block diagram illustrating an example transceiver, according to aspects of the disclosure.

FIG. 5 is a diagram illustrating an example frame structure, according to aspects of the disclosure.

FIG. 6 illustrates an example of a radio frequency (RF) signal spanning contiguous component carriers to increase the effective bandwidth of the RF signal, according to aspects of the disclosure.

FIG. 7 is a graph showing a radio frequency (RF) channel impulse response over time, according to aspects of the disclosure.

FIG. 8 is a graph of example time domain waveforms for two separate frequency bands, according to aspects of the disclosure.

FIG. 9 illustrates example simulation results for the disclosed matrix pencil algorithm, according to aspects of the disclosure.

FIGS. 10A and 10B illustrate an example processing flow of the disclosed matrix pencil algorithm, according to aspects of the disclosure.

FIG. 11 illustrates an example of an RF signal that is received on three disjoint frequency layers that are measured in consecutive time periods, according to aspects of the disclosure.

FIG. 12 illustrates a time alignment processing block added to the processing flow illustrated in FIGS. 10A and 10B, according to aspects of the disclosure.

FIG. 13 illustrates an example method of wireless communication, according to aspects of the disclosure.

DETAILED DESCRIPTION

Aspects of the disclosure are provided in the following description and related drawings directed to various examples provided for illustration purposes. Alternate aspects may be devised without departing from the scope of the disclosure. Additionally, well-known elements of the disclosure will not be described in detail or will be omitted so as not to obscure the relevant details of the disclosure.

The words “exemplary” and/or “example” are used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” and/or “example” is not necessarily to be construed as preferred or advantageous over other aspects. Likewise, the term “aspects of the disclosure” does not require that all aspects of the disclosure include the discussed feature, advantage or mode of operation.

Those of skill in the art will appreciate that the information and signals described below may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the description below may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof, depending in part on the particular application, in part on the desired design, in part on the corresponding technology, etc.

Further, many aspects are described in terms of sequences of actions to be performed by, for example, elements of a computing device. It will be recognized that various actions described herein can be performed by specific circuits (e.g., application specific integrated circuits (ASICs)), by program instructions being executed by one or more processors, or by a combination of both. Additionally, the sequence(s) of actions described herein can be considered to be embodied entirely within any form of non-transitory computer-readable storage medium having stored therein a corresponding set of computer instructions that, upon execution, would cause or instruct an associated processor of a device to perform the functionality described herein. Thus, the various aspects of the disclosure may be embodied in a number of different forms, all of which have been contemplated to be within the scope of the claimed subject matter. In addition, for each of the aspects described herein, the corresponding form of any such aspects may be described herein as, for example, “logic configured to” perform the described action.

As used herein, the terms “user equipment” (UE) and “base station” are not intended to be specific or otherwise limited to any particular radio access technology (RAT), unless otherwise noted. In general, a UE may be any wireless communication device (e.g., a mobile phone, router, tablet computer, laptop computer, consumer asset locating device, wearable (e.g., smartwatch, glasses, augmented reality (AR)/virtual reality (VR) headset, etc.), vehicle (e.g., automobile, motorcycle, bicycle, etc.), Internet of Things (IoT) device, etc.) used by a user to communicate over a wireless communications network. A UE may be mobile or may (e.g., at certain times) be stationary, and may communicate with a radio access network (RAN). As used herein, the term “UE” may be referred to interchangeably as an “access terminal” or “AT,” a “client device,” a “wireless device,” a “subscriber device,” a “subscriber terminal,” a “subscriber station,” a “user terminal” or “UT,” a “mobile device,” a “mobile terminal,” a “mobile station,” or variations thereof. Generally, UEs can communicate with a core network via a RAN, and through the core network the UEs can be connected with external networks such as the Internet and with other UEs. Of course, other mechanisms of connecting to the core network and/or the Internet are also possible for the UEs, such as over wired access networks, wireless local area network (WLAN) networks (e.g., based on the Institute of Electrical and Electronics Engineers (IEEE) 802.11 specification, etc.) and so on.

A base station may operate according to one of several RATs in communication with UEs depending on the network in which it is deployed, and may be alternatively referred to as an access point (AP), a network node, a NodeB, an evolved NodeB (eNB), a next generation eNB (ng-eNB), a New Radio (NR) Node B (also referred to as a gNB or gNodeB), etc. A base station may be used primarily to support wireless access by UEs, including supporting data, voice, and/or signaling connections for the supported UEs. In some systems a base station may provide purely edge node signaling functions while in other systems it may provide additional control and/or network management functions. A communication link through which UEs can send signals to a base station is called an uplink (UL) channel (e.g., a reverse traffic channel, a reverse control channel, an access channel, etc.). A communication link through which the base station can send signals to UEs is called a downlink (DL) or forward link channel (e.g., a paging channel, a control channel, a broadcast channel, a forward traffic channel, etc.). As used herein the term traffic channel (TCH) can refer to either an uplink/reverse or downlink/forward traffic channel.

The term “base station” may refer to a single physical transmission-reception point (TRP) or to multiple physical TRPs that may or may not be co-located. For example, where the term “base station” refers to a single physical TRP, the physical TRP may be an antenna of the base station corresponding to a cell (or several cell sectors) of the base station. Where the term “base station” refers to multiple co-located physical TRPs, the physical TRPs may be an array of antennas (e.g., as in a multiple-input multiple-output (MIMO) system or where the base station employs beamforming) of the base station. Where the term “base station” refers to multiple non-co-located physical TRPs, the physical TRPs may be a distributed antenna system (DAS) (a network of spatially separated antennas connected to a common source via a transport medium) or a remote radio head (RRH) (a remote base station connected to a serving base station). Alternatively, the non-co-located physical TRPs may be the serving base station receiving the measurement report from the UE and a neighbor base station whose reference radio frequency (RF) signals the UE is measuring. Because a TRP is the point from which a base station transmits and receives wireless signals, as used herein, references to transmission from or reception at a base station are to be understood as referring to a particular TRP of the base station.

In some implementations that support positioning of UEs, a base station may not support wireless access by UEs (e.g., may not support data, voice, and/or signaling connections for UEs), but may instead transmit reference signals to UEs to be measured by the UEs, and/or may receive and measure signals transmitted by the UEs. Such a base station may be referred to as a positioning beacon (e.g., when transmitting signals to UEs) and/or as a location measurement unit (e.g., when receiving and measuring signals from UEs).

An “RF signal” comprises an electromagnetic wave of a given frequency that transports information through the space between a transmitter and a receiver. As used herein, a transmitter may transmit a single “RF signal” or multiple “RF signals” to a receiver. However, the receiver may receive multiple “RF signals” corresponding to each transmitted RF signal due to the propagation characteristics of RF signals through multipath channels. The same transmitted RF signal on different paths between the transmitter and receiver may be referred to as a “multipath” RF signal. As used herein, an RF signal may also be referred to as a “wireless signal” or simply a “signal” where it is clear from the context that the term “signal” refers to a wireless signal or an RF signal.

FIG. 1 illustrates an example wireless communications system 100, according to aspects of the disclosure. The wireless communications system 100 (which may also be referred to as a wireless wide area network (WWAN)) may include various base stations 102 (labeled “BS”) and various UEs 104. The base stations 102 may include macro cell base stations (high power cellular base stations) and/or small cell base stations (low power cellular base stations). In an aspect, the macro cell base stations may include eNBs and/or ng-eNBs where the wireless communications system 100 corresponds to an LTE network, or gNBs where the wireless communications system 100 corresponds to a NR network, or a combination of both, and the small cell base stations may include femtocells, picocells, microcells, etc.

The base stations 102 may collectively form a RAN and interface with a core network 170 (e.g., an evolved packet core (EPC) or a 5G core (5GC)) through backhaul links 122, and through the core network 170 to one or more location servers 172 (e.g., a location management function (LMF) or a secure user plane location (SUPL) location platform (SLP)). The location server(s) 172 may be part of core network 170 or may be external to core network 170. In addition to other functions, the base stations 102 may perform functions that relate to one or more of transferring user data, radio channel ciphering and deciphering, integrity protection, header compression, mobility control functions (e.g., handover, dual connectivity), inter-cell interference coordination, connection setup and release, load balancing, distribution for non-access stratum (NAS) messages, NAS node selection, synchronization, RAN sharing, multimedia broadcast multicast service (MBMS), subscriber and equipment trace, RAN information management (RIM), paging, positioning, and delivery of warning messages. The base stations 102 may communicate with each other directly or indirectly (e.g., through the EPC/5GC) over backhaul links 134, which may be wired or wireless.

The base stations 102 may wirelessly communicate with the UEs 104. Each of the base stations 102 may provide communication coverage for a respective geographic coverage area 110. In an aspect, one or more cells may be supported by a base station 102 in each geographic coverage area 110. A “cell” is a logical communication entity used for communication with a base station (e.g., over some frequency resource, referred to as a carrier frequency, component carrier, carrier, band, or the like), and may be associated with an identifier (e.g., a physical cell identifier (PCI), an enhanced cell identifier (ECI), a virtual cell identifier (VCI), a cell global identifier (CGI), etc.) for distinguishing cells operating via the same or a different carrier frequency. In some cases, different cells may be configured according to different protocol types (e.g., machine-type communication (MTC), narrowband IoT (NB-IoT), enhanced mobile broadband (eMBB), or others) that may provide access for different types of UEs. Because a cell is supported by a specific base station, the term “cell” may refer to either or both of the logical communication entity and the base station that supports it, depending on the context. In addition, because a TRP is typically the physical transmission point of a cell, the terms “cell” and “TRP” may be used interchangeably. In some cases, the term “cell” may also refer to a geographic coverage area of a base station (e.g., a sector), insofar as a carrier frequency can be detected and used for communication within some portion of geographic coverage areas 110.

While neighboring macro cell base station 102 geographic coverage areas 110 may partially overlap (e.g., in a handover region), some of the geographic coverage areas 110 may be substantially overlapped by a larger geographic coverage area 110. For example, a small cell base station 102′ (labeled “SC” for “small cell”) may have a geographic coverage area 110′ that substantially overlaps with the geographic coverage area 110 of one or more macro cell base stations 102. A network that includes both small cell and macro cell base stations may be known as a heterogeneous network. A heterogeneous network may also include home eNBs (HeNBs), which may provide service to a restricted group known as a closed subscriber group (CSG).

The communication links 120 between the base stations 102 and the UEs 104 may include uplink (also referred to as reverse link) transmissions from a UE 104 to a base station 102 and/or downlink (DL) (also referred to as forward link) transmissions from a base station 102 to a UE 104. The communication links 120 may use MIMO antenna technology, including spatial multiplexing, beamforming, and/or transmit diversity. The communication links 120 may be through one or more carrier frequencies. Allocation of carriers may be asymmetric with respect to downlink and uplink (e.g., more or less carriers may be allocated for downlink than for uplink).

The wireless communications system 100 may further include a wireless local area network (WLAN) access point (AP) 150 in communication with WLAN stations (STAs) 152 via communication links 154 in an unlicensed frequency spectrum (e.g., 5 GHz). When communicating in an unlicensed frequency spectrum, the WLAN STAs 152 and/or the WLAN AP 150 may perform a clear channel assessment (CCA) or listen before talk (LBT) procedure prior to communicating in order to determine whether the channel is available.

The small cell base station 102′ may operate in a licensed and/or an unlicensed frequency spectrum. When operating in an unlicensed frequency spectrum, the small cell base station 102′ may employ LTE or NR technology and use the same 5 GHz unlicensed frequency spectrum as used by the WLAN AP 150. The small cell base station 102′, employing LTE/5G in an unlicensed frequency spectrum, may boost coverage to and/or increase capacity of the access network. NR in unlicensed spectrum may be referred to as NR-U. LTE in an unlicensed spectrum may be referred to as LTE-U, licensed assisted access (LAA), or MulteFire.

The wireless communications system 100 may further include a millimeter wave (mmW) base station 180 that may operate in mmW frequencies and/or near mmW frequencies in communication with a UE 182. Extremely high frequency (EHF) is part of the RF in the electromagnetic spectrum. EHF has a range of 30 GHz to 300 GHz and a wavelength between 1 millimeter and 10 millimeters. Radio waves in this band may be referred to as a millimeter wave. Near mmW may extend down to a frequency of 3 GHz with a wavelength of 100 millimeters. The super high frequency (SHF) band extends between 3 GHz and 30 GHz, also referred to as centimeter wave. Communications using the mmW/near mmW radio frequency band have high path loss and a relatively short range. The mmW base station 180 and the UE 182 may utilize beamforming (transmit and/or receive) over a mmW communication link 184 to compensate for the extremely high path loss and short range. Further, it will be appreciated that in alternative configurations, one or more base stations 102 may also transmit using mmW or near mmW and beamforming. Accordingly, it will be appreciated that the foregoing illustrations are merely examples and should not be construed to limit the various aspects disclosed herein.

Transmit beamforming is a technique for focusing an RF signal in a specific direction. Traditionally, when a network node (e.g., a base station) broadcasts an RF signal, it broadcasts the signal in all directions (omni-directionally). With transmit beamforming, the network node determines where a given target device (e.g., a UE) is located (relative to the transmitting network node) and projects a stronger downlink RF signal in that specific direction, thereby providing a faster (in terms of data rate) and stronger RF signal for the receiving device(s). To change the directionality of the RF signal when transmitting, a network node can control the phase and relative amplitude of the RF signal at each of the one or more transmitters that are broadcasting the RF signal. For example, a network node may use an array of antennas (referred to as a “phased array” or an “antenna array”) that creates a beam of RF waves that can be “steered” to point in different directions, without actually moving the antennas. Specifically, the RF current from the transmitter is fed to the individual antennas with the correct phase relationship so that the radio waves from the separate antennas add together to increase the radiation in a desired direction, while cancelling to suppress radiation in undesired directions.

Transmit beams may be quasi-co-located, meaning that they appear to the receiver (e.g., a UE) as having the same parameters, regardless of whether or not the transmitting antennas of the network node themselves are physically co-located. In NR, there are four types of quasi-co-location (QCL) relations. Specifically, a QCL relation of a given type means that certain parameters about a second reference RF signal on a second beam can be derived from information about a source reference RF signal on a source beam. Thus, if the source reference RF signal is QCL Type A, the receiver can use the source reference RF signal to estimate the Doppler shift, Doppler spread, average delay, and delay spread of a second reference RF signal transmitted on the same channel. If the source reference RF signal is QCL Type B, the receiver can use the source reference RF signal to estimate the Doppler shift and Doppler spread of a second reference RF signal transmitted on the same channel. If the source reference RF signal is QCL Type C, the receiver can use the source reference RF signal to estimate the Doppler shift and average delay of a second reference RF signal transmitted on the same channel. If the source reference RF signal is QCL Type D, the receiver can use the source reference RF signal to estimate the spatial receive parameter of a second reference RF signal transmitted on the same channel.

In receive beamforming, the receiver uses a receive beam to amplify RF signals detected on a given channel. For example, the receiver can increase the gain setting and/or adjust the phase setting of an array of antennas in a particular direction to amplify (e.g., to increase the gain level of) the RF signals received from that direction. Thus, when a receiver is said to beamform in a certain direction, it means the beam gain in that direction is high relative to the beam gain along other directions, or the beam gain in that direction is the highest compared to the beam gain in that direction of all other receive beams available to the receiver. This results in a stronger received signal strength (e.g., reference signal received power (RSRP), reference signal received quality (RSRQ), signal-to-interference-plus-noise ratio (SINR), etc.) of the RF signals received from that direction.

Transmit and receive beams may be spatially related. A spatial relation means that parameters for a second beam (e.g., a transmit or receive beam) for a second reference signal can be derived from information about a first beam (e.g., a receive beam or a transmit beam) for a first reference signal. For example, a UE may use a particular receive beam to receive a reference downlink reference signal (e.g., synchronization signal block (SSB)) from a base station. The UE can then form a transmit beam for sending an uplink reference signal (e.g., sounding reference signal (SRS)) to that base station based on the parameters of the receive beam.

Note that a “downlink” beam may be either a transmit beam or a receive beam, depending on the entity forming it. For example, if a base station is forming the downlink beam to transmit a reference signal to a UE, the downlink beam is a transmit beam. If the UE is forming the downlink beam, however, it is a receive beam to receive the downlink reference signal. Similarly, an “uplink” beam may be either a transmit beam or a receive beam, depending on the entity forming it. For example, if a base station is forming the uplink beam, it is an uplink receive beam, and if a UE is forming the uplink beam, it is an uplink transmit beam.

In 5G, the frequency spectrum in which wireless nodes (e.g., base stations 102/180, UEs 104/182) operate is divided into multiple frequency ranges, FR1 (from 450 to 6000 MHz), FR2 (from 24250 to 52600 MHz), FR3 (above 52600 MHz), and FR4 (between FR1 and FR2). mmW frequency bands generally include the FR2, FR3, and FR4 frequency ranges. As such, the terms “mmW” and “FR2” or “FR3” or “FR4” may generally be used interchangeably.

In a multi-carrier system, such as 5G, one of the carrier frequencies is referred to as the “primary carrier” or “anchor carrier” or “primary serving cell” or “PCell,” and the remaining carrier frequencies are referred to as “secondary carriers” or “secondary serving cells” or “SCells.” In carrier aggregation, the anchor carrier is the carrier operating on the primary frequency (e.g., FR1) utilized by a UE 104/182 and the cell in which the UE 104/182 either performs the initial radio resource control (RRC) connection establishment procedure or initiates the RRC connection re-establishment procedure. The primary carrier carries all common and UE-specific control channels, and may be a carrier in a licensed frequency (however, this is not always the case). A secondary carrier is a carrier operating on a second frequency (e.g., FR2) that may be configured once the RRC connection is established between the UE 104 and the anchor carrier and that may be used to provide additional radio resources. In some cases, the secondary carrier may be a carrier in an unlicensed frequency. The secondary carrier may contain only necessary signaling information and signals, for example, those that are UE-specific may not be present in the secondary carrier, since both primary uplink and downlink carriers are typically UE-specific. This means that different UEs 104/182 in a cell may have different downlink primary carriers. The same is true for the uplink primary carriers. The network is able to change the primary carrier of any UE 104/182 at any time. This is done, for example, to balance the load on different carriers. Because a “serving cell” (whether a PCell or an SCell) corresponds to a carrier frequency/component carrier over which some base station is communicating, the term “cell,” “serving cell,” “component carrier,” “carrier frequency,” and the like can be used interchangeably.

For example, still referring to FIG. 1, one of the frequencies utilized by the macro cell base stations 102 may be an anchor carrier (or “PCell”) and other frequencies utilized by the macro cell base stations 102 and/or the mmW base station 180 may be secondary carriers (“SCells”). The simultaneous transmission and/or reception of multiple carriers enables the UE 104/182 to significantly increase its data transmission and/or reception rates. For example, two 20 MHz aggregated carriers in a multi-carrier system would theoretically lead to a two-fold increase in data rate (i.e., 40 MHz), compared to that attained by a single 20 MHz carrier.

The wireless communications system 100 may further include a UE 164 that may communicate with a macro cell base station 102 over a communication link 120 and/or the mmW base station 180 over a mmW communication link 184. For example, the macro cell base station 102 may support a PCell and one or more SCells for the UE 164 and the mmW base station 180 may support one or more SCells for the UE 164.

In the example of FIG. 1, any of the illustrated UEs (shown in FIG. 1 as a single UE 104 for simplicity) may receive signals 124 from one or more Earth orbiting space vehicles (SVs) 112 (e.g., satellites). In an aspect, the SVs 112 may be part of a satellite positioning system that a UE 104 can use as an independent source of location information. A satellite positioning system typically includes a system of transmitters (e.g., SVs 112) positioned to enable receivers (e.g., UEs 104) to determine their location on or above the Earth based, at least in part, on positioning signals (e.g., signals 124) received from the transmitters. Such a transmitter typically transmits a signal marked with a repeating pseudo-random noise (PN) code of a set number of chips. While typically located in SVs 112, transmitters may sometimes be located on ground-based control stations, base stations 102, and/or other UEs 104. A UE 104 may include one or more dedicated receivers specifically designed to receive signals 124 for deriving geo location information from the SVs 112.

In a satellite positioning system, the use of signals 124 can be augmented by various satellite-based augmentation systems (SBAS) that may be associated with or otherwise enabled for use with one or more global and/or regional navigation satellite systems. For example an SBAS may include an augmentation system(s) that provides integrity information, differential corrections, etc., such as the Wide Area Augmentation System (WAAS), the European Geostationary Navigation Overlay Service (EGNOS), the Multi-functional Satellite Augmentation System (MSAS), the Global Positioning System (GPS) Aided Geo Augmented Navigation or GPS and Geo Augmented Navigation system (GAGAN), and/or the like. Thus, as used herein, a satellite positioning system may include any combination of one or more global and/or regional navigation satellites associated with such one or more satellite positioning systems.

In an aspect, SVs 112 may additionally or alternatively be part of one or more non-terrestrial networks (NTNs). In an NTN, an SV 112 is connected to an earth station (also referred to as a ground station, NTN gateway, or gateway), which in turn is connected to an element in a 5G network, such as a modified base station 102 (without a terrestrial antenna) or a network node in a 5GC. This element would in turn provide access to other elements in the 5G network and ultimately to entities external to the 5G network, such as Internet web servers and other user devices. In that way, a UE 104 may receive communication signals (e.g., signals 124) from an SV 112 instead of, or in addition to, communication signals from a terrestrial base station 102.

The wireless communications system 100 may further include one or more UEs, such as UE 190, that connects indirectly to one or more communication networks via one or more device-to-device (D2D) peer-to-peer (P2P) links (referred to as “sidelinks”). In the example of FIG. 1, UE 190 has a D2D P2P link 192 with one of the UEs 104 connected to one of the base stations 102 (e.g., through which UE 190 may indirectly obtain cellular connectivity) and a D2D P2P link 194 with WLAN STA 152 connected to the WLAN AP 150 (through which UE 190 may indirectly obtain WLAN-based Internet connectivity). In an example, the D2D P2P links 192 and 194 may be supported with any well-known D2D RAT, such as LTE Direct (LTE-D), WiFi Direct (WiFi-D), Bluetooth®, and so on.

FIG. 2A illustrates an example wireless network structure 200. For example, a 5GC 210 (also referred to as a Next Generation Core (NGC)) can be viewed functionally as control plane (C-plane) functions 214 (e.g., UE registration, authentication, network access, gateway selection, etc.) and user plane (U-plane) functions 212, (e.g., UE gateway function, access to data networks, IP routing, etc.) which operate cooperatively to form the core network. User plane interface (NG-U) 213 and control plane interface (NG-C) 215 connect the gNB 222 to the 5GC 210 and specifically to the user plane functions 212 and control plane functions 214, respectively. In an additional configuration, an ng-eNB 224 may also be connected to the 5GC 210 via NG-C 215 to the control plane functions 214 and NG-U 213 to user plane functions 212. Further, ng-eNB 224 may directly communicate with gNB 222 via a backhaul connection 223. In some configurations, a Next Generation RAN (NG-RAN) 220 may have one or more gNBs 222, while other configurations include one or more of both ng-eNBs 224 and gNBs 222. Either (or both) gNB 222 or ng-eNB 224 may communicate with one or more UEs 204 (e.g., any of the UEs described herein).

Another optional aspect may include a location server 230, which may be in communication with the 5GC 210 to provide location assistance for UE(s) 204. The location server 230 can be implemented as a plurality of separate servers (e.g., physically separate servers, different software modules on a single server, different software modules spread across multiple physical servers, etc.), or alternately may each correspond to a single server. The location server 230 can be configured to support one or more location services for UEs 204 that can connect to the location server 230 via the core network, 5GC 210, and/or via the Internet (not illustrated). Further, the location server 230 may be integrated into a component of the core network, or alternatively may be external to the core network (e.g., a third party server, such as an original equipment manufacturer (OEM) server or service server).

FIG. 2B illustrates another example wireless network structure 250. A 5GC 260 (which may correspond to 5GC 210 in FIG. 2A) can be viewed functionally as control plane functions, provided by an access and mobility management function (AMF) 264, and user plane functions, provided by a user plane function (UPF) 262, which operate cooperatively to form the core network (i.e., 5GC 260). The functions of the AMF 264 include registration management, connection management, reachability management, mobility management, lawful interception, transport for session management (SM) messages between one or more UEs 204 (e.g., any of the UEs described herein) and a session management function (SMF) 266, transparent proxy services for routing SM messages, access authentication and access authorization, transport for short message service (SMS) messages between the UE 204 and the short message service function (SMSF) (not shown), and security anchor functionality (SEAF). The AMF 264 also interacts with an authentication server function (AUSF) (not shown) and the UE 204, and receives the intermediate key that was established as a result of the UE 204 authentication process. In the case of authentication based on a UMTS (universal mobile telecommunications system) subscriber identity module (USIM), the AMF 264 retrieves the security material from the AUSF. The functions of the AMF 264 also include security context management (SCM). The SCM receives a key from the SEAF that it uses to derive access-network specific keys. The functionality of the AMF 264 also includes location services management for regulatory services, transport for location services messages between the UE 204 and a location management function (LMF) 270 (which acts as a location server 230), transport for location services messages between the NG-RAN 220 and the LMF 270, evolved packet system (EPS) bearer identifier allocation for interworking with the EPS, and UE 204 mobility event notification. In addition, the AMF 264 also supports functionalities for non-3GPP (Third Generation Partnership Project) access networks.

Functions of the UPF 262 include acting as an anchor point for intra-/inter-RAT mobility (when applicable), acting as an external protocol data unit (PDU) session point of interconnect to a data network (not shown), providing packet routing and forwarding, packet inspection, user plane policy rule enforcement (e.g., gating, redirection, traffic steering), lawful interception (user plane collection), traffic usage reporting, quality of service (QoS) handling for the user plane (e.g., uplink/downlink rate enforcement, reflective QoS marking in the downlink), uplink traffic verification (service data flow (SDF) to QoS flow mapping), transport level packet marking in the uplink and downlink, downlink packet buffering and downlink data notification triggering, and sending and forwarding of one or more “end markers” to the source RAN node. The UPF 262 may also support transfer of location services messages over a user plane between the UE 204 and a location server, such as an SLP 272.

The functions of the SMF 266 include session management, UE Internet protocol (IP) address allocation and management, selection and control of user plane functions, configuration of traffic steering at the UPF 262 to route traffic to the proper destination, control of part of policy enforcement and QoS, and downlink data notification. The interface over which the SMF 266 communicates with the AMF 264 is referred to as the N11 interface.

Another optional aspect may include an LMF 270, which may be in communication with the 5GC 260 to provide location assistance for UEs 204. The LMF 270 can be implemented as a plurality of separate servers (e.g., physically separate servers, different software modules on a single server, different software modules spread across multiple physical servers, etc.), or alternately may each correspond to a single server. The LMF 270 can be configured to support one or more location services for UEs 204 that can connect to the LMF 270 via the core network, 5GC 260, and/or via the Internet (not illustrated). The SLP 272 may support similar functions to the LMF 270, but whereas the LMF 270 may communicate with the AMF 264, NG-RAN 220, and UEs 204 over a control plane (e.g., using interfaces and protocols intended to convey signaling messages and not voice or data), the SLP 272 may communicate with UEs 204 and external clients (not shown in FIG. 2B) over a user plane (e.g., using protocols intended to carry voice and/or data like the transmission control protocol (TCP) and/or IP).

User plane interface 263 and control plane interface 265 connect the 5GC 260, and specifically the UPF 262 and AMF 264, respectively, to one or more gNBs 222 and/or ng-eNBs 224 in the NG-RAN 220. The interface between gNB(s) 222 and/or ng-eNB(s) 224 and the AMF 264 is referred to as the “N2” interface, and the interface between gNB(s) 222 and/or ng-eNB(s) 224 and the UPF 262 is referred to as the “N3” interface. The gNB(s) 222 and/or ng-eNB(s) 224 of the NG-RAN 220 may communicate directly with each other via backhaul connections 223, referred to as the “Xn-C” interface. One or more of gNBs 222 and/or ng-eNBs 224 may communicate with one or more UEs 204 over a wireless interface, referred to as the “Uu” interface.

The functionality of a gNB 222 is divided between a gNB central unit (gNB-CU) 226 and one or more gNB distributed units (gNB-DUs) 228. The interface 232 between the gNB-CU 226 and the one or more gNB-DUs 228 is referred to as the “F1” interface. A gNB-CU 226 is a logical node that includes the base station functions of transferring user data, mobility control, radio access network sharing, positioning, session management, and the like, except for those functions allocated exclusively to the gNB-DU(s) 228. More specifically, the gNB-CU 226 hosts the radio resource control (RRC), service data adaptation protocol (SDAP), and packet data convergence protocol (PDCP) protocols of the gNB 222. A gNB-DU 228 is a logical node that hosts the radio link control (RLC), medium access control (MAC), and physical (PHY) layers of the gNB 222. Its operation is controlled by the gNB-CU 226. One gNB-DU 228 can support one or more cells, and one cell is supported by only one gNB-DU 228. Thus, a UE 204 communicates with the gNB-CU 226 via the RRC, SDAP, and PDCP layers and with a gNB-DU 228 via the RLC, MAC, and PHY layers.

FIGS. 3A, 3B, and 3C illustrate several example components (represented by corresponding blocks) that may be incorporated into a UE 302 (which may correspond to any of the UEs described herein), a base station 304 (which may correspond to any of the base stations described herein), and a network entity 306 (which may correspond to or embody any of the network functions described herein, including the location server 230 and the LMF 270, or alternatively may be independent from the NG-RAN 220 and/or 5GC 210/260 infrastructure depicted in FIGS. 2A and 2B, such as a private network) to support the file transmission operations as taught herein. It will be appreciated that these components may be implemented in different types of apparatuses in different implementations (e.g., in an ASIC, in a system-on-chip (SoC), etc.). The illustrated components may also be incorporated into other apparatuses in a communication system. For example, other apparatuses in a system may include components similar to those described to provide similar functionality. Also, a given apparatus may contain one or more of the components. For example, an apparatus may include multiple transceiver components that enable the apparatus to operate on multiple carriers and/or communicate via different technologies.

The UE 302 and the base station 304 each include one or more wireless wide area network (WWAN) transceivers 310 and 350, respectively, providing means for communicating (e.g., means for transmitting, means for receiving, means for measuring, means for tuning, means for refraining from transmitting, etc.) via one or more wireless communication networks (not shown), such as an NR network, an LTE network, a GSM network, and/or the like. The WWAN transceivers 310 and 350 may each be connected to one or more antennas 316 and 356, respectively, for communicating with other network nodes, such as other UEs, access points, base stations (e.g., eNBs, gNBs), etc., via at least one designated RAT (e.g., NR, LTE, GSM, etc.) over a wireless communication medium of interest (e.g., some set of time/frequency resources in a particular frequency spectrum). The WWAN transceivers 310 and 350 may be variously configured for transmitting and encoding signals 318 and 358 (e.g., messages, indications, information, and so on), respectively, and, conversely, for receiving and decoding signals 318 and 358 (e.g., messages, indications, information, pilots, and so on), respectively, in accordance with the designated RAT. Specifically, the WWAN transceivers 310 and 350 include one or more transmitters 314 and 354, respectively, for transmitting and encoding signals 318 and 358, respectively, and one or more receivers 312 and 352, respectively, for receiving and decoding signals 318 and 358, respectively.

The UE 302 and the base station 304 each also include, at least in some cases, one or more short-range wireless transceivers 320 and 360, respectively. The short-range wireless transceivers 320 and 360 may be connected to one or more antennas 326 and 366, respectively, and provide means for communicating (e.g., means for transmitting, means for receiving, means for measuring, means for tuning, means for refraining from transmitting, etc.) with other network nodes, such as other UEs, access points, base stations, etc., via at least one designated RAT (e.g., WiFi, LTE-D, Bluetooth®, Zigbee®, Z-Wave®, PC5, dedicated short-range communications (DSRC), wireless access for vehicular environments (WAVE), near-field communication (NFC), etc.) over a wireless communication medium of interest. The short-range wireless transceivers 320 and 360 may be variously configured for transmitting and encoding signals 328 and 368 (e.g., messages, indications, information, and so on), respectively, and, conversely, for receiving and decoding signals 328 and 368 (e.g., messages, indications, information, pilots, and so on), respectively, in accordance with the designated RAT. Specifically, the short-range wireless transceivers 320 and 360 include one or more transmitters 324 and 364, respectively, for transmitting and encoding signals 328 and 368, respectively, and one or more receivers 322 and 362, respectively, for receiving and decoding signals 328 and 368, respectively. As specific examples, the short-range wireless transceivers 320 and 360 may be WiFi transceivers, Bluetooth® transceivers, Zigbee® and/or Z-Wave® transceivers, NFC transceivers, or vehicle-to-vehicle (V2V) and/or vehicle-to-everything (V2X) transceivers.

The UE 302 and the base station 304 also include, at least in some cases, satellite signal receivers 330 and 370. The satellite signal receivers 330 and 370 may be connected to one or more antennas 336 and 376, respectively, and may provide means for receiving and/or measuring satellite positioning/communication signals 338 and 378, respectively. Where the satellite signal receivers 330 and 370 are satellite positioning system receivers, the satellite positioning/communication signals 338 and 378 may be global positioning system (GPS) signals, global navigation satellite system (GLONASS) signals, Galileo signals, Beidou signals, Indian Regional Navigation Satellite System (NAVIC), Quasi-Zenith Satellite System (QZSS), etc. Where the satellite signal receivers 330 and 370 are non-terrestrial network (NTN) receivers, the satellite positioning/communication signals 338 and 378 may be communication signals (e.g., carrying control and/or user data) originating from a 5G network. The satellite signal receivers 330 and 370 may comprise any suitable hardware and/or software for receiving and processing satellite positioning/communication signals 338 and 378, respectively. The satellite signal receivers 330 and 370 may request information and operations as appropriate from the other systems, and, at least in some cases, perform calculations to determine locations of the UE 302 and the base station 304, respectively, using measurements obtained by any suitable satellite positioning system algorithm.

The base station 304 and the network entity 306 each include one or more network transceivers 380 and 390, respectively, providing means for communicating (e.g., means for transmitting, means for receiving, etc.) with other network entities (e.g., other base stations 304, other network entities 306). For example, the base station 304 may employ the one or more network transceivers 380 to communicate with other base stations 304 or network entities 306 over one or more wired or wireless backhaul links. As another example, the network entity 306 may employ the one or more network transceivers 390 to communicate with one or more base station 304 over one or more wired or wireless backhaul links, or with other network entities 306 over one or more wired or wireless core network interfaces.

A transceiver may be configured to communicate over a wired or wireless link. A transceiver (whether a wired transceiver or a wireless transceiver) includes transmitter circuitry (e.g., transmitters 314, 324, 354, 364) and receiver circuitry (e.g., receivers 312, 322, 352, 362). A transceiver may be an integrated device (e.g., embodying transmitter circuitry and receiver circuitry in a single device) in some implementations, may comprise separate transmitter circuitry and separate receiver circuitry in some implementations, or may be embodied in other ways in other implementations. The transmitter circuitry and receiver circuitry of a wired transceiver (e.g., network transceivers 380 and 390 in some implementations) may be coupled to one or more wired network interface ports. Wireless transmitter circuitry (e.g., transmitters 314, 324, 354, 364) may include or be coupled to a plurality of antennas (e.g., antennas 316, 326, 356, 366), such as an antenna array, that permits the respective apparatus (e.g., UE 302, base station 304) to perform transmit “beamforming,” as described herein. Similarly, wireless receiver circuitry (e.g., receivers 312, 322, 352, 362) may include or be coupled to a plurality of antennas (e.g., antennas 316, 326, 356, 366), such as an antenna array, that permits the respective apparatus (e.g., UE 302, base station 304) to perform receive beamforming, as described herein. In an aspect, the transmitter circuitry and receiver circuitry may share the same plurality of antennas (e.g., antennas 316, 326, 356, 366), such that the respective apparatus can only receive or transmit at a given time, not both at the same time. A wireless transceiver (e.g., WWAN transceivers 310 and 350, short-range wireless transceivers 320 and 360) may also include a network listen module (NLM) or the like for performing various measurements.

As used herein, the various wireless transceivers (e.g., transceivers 310, 320, 350, and 360, and network transceivers 380 and 390 in some implementations) and wired transceivers (e.g., network transceivers 380 and 390 in some implementations) may generally be characterized as “a transceiver,” “at least one transceiver,” or “one or more transceivers.” As such, whether a particular transceiver is a wired or wireless transceiver may be inferred from the type of communication performed. For example, backhaul communication between network devices or servers will generally relate to signaling via a wired transceiver, whereas wireless communication between a UE (e.g., UE 302) and a base station (e.g., base station 304) will generally relate to signaling via a wireless transceiver.

The UE 302, the base station 304, and the network entity 306 also include other components that may be used in conjunction with the operations as disclosed herein. The UE 302, the base station 304, and the network entity 306 include one or more processors 332, 384, and 394, respectively, for providing functionality relating to, for example, wireless communication, and for providing other processing functionality. The processors 332, 384, and 394 may therefore provide means for processing, such as means for determining, means for calculating, means for receiving, means for transmitting, means for indicating, etc. In an aspect, the processors 332, 384, and 394 may include, for example, one or more general purpose processors, multi-core processors, central processing units (CPUs), ASICs, digital signal processors (DSPs), field programmable gate arrays (FPGAs), other programmable logic devices or processing circuitry, or various combinations thereof.

The UE 302, the base station 304, and the network entity 306 include memory circuitry implementing memories 340, 386, and 396 (e.g., each including a memory device), respectively, for maintaining information (e.g., information indicative of reserved resources, thresholds, parameters, and so on). The memories 340, 386, and 396 may therefore provide means for storing, means for retrieving, means for maintaining, etc. In some cases, the UE 302, the base station 304, and the network entity 306 may include positioning component 342, 388, and 398, respectively. The positioning component 342, 388, and 398 may be hardware circuits that are part of or coupled to the processors 332, 384, and 394, respectively, that, when executed, cause the UE 302, the base station 304, and the network entity 306 to perform the functionality described herein. In other aspects, the positioning component 342, 388, and 398 may be external to the processors 332, 384, and 394 (e.g., part of a modem processing system, integrated with another processing system, etc.). Alternatively, the positioning component 342, 388, and 398 may be memory modules stored in the memories 340, 386, and 396, respectively, that, when executed by the processors 332, 384, and 394 (or a modem processing system, another processing system, etc.), cause the UE 302, the base station 304, and the network entity 306 to perform the functionality described herein. FIG. 3A illustrates possible locations of the positioning component 342, which may be, for example, part of the one or more WWAN transceivers 310, the memory 340, the one or more processors 332, or any combination thereof, or may be a standalone component. FIG. 3B illustrates possible locations of the positioning component 388, which may be, for example, part of the one or more WWAN transceivers 350, the memory 386, the one or more processors 384, or any combination thereof, or may be a standalone component. FIG. 3C illustrates possible locations of the positioning component 398, which may be, for example, part of the one or more network transceivers 390, the memory 396, the one or more processors 394, or any combination thereof, or may be a standalone component.

The UE 302 may include one or more sensors 344 coupled to the one or more processors 332 to provide means for sensing or detecting movement and/or orientation information that is independent of motion data derived from signals received by the one or more WWAN transceivers 310, the one or more short-range wireless transceivers 320, and/or the satellite signal receiver 330. By way of example, the sensor(s) 344 may include an accelerometer (e.g., a micro-electrical mechanical systems (MEMS) device), a gyroscope, a geomagnetic sensor (e.g., a compass), an altimeter (e.g., a barometric pressure altimeter), and/or any other type of movement detection sensor. Moreover, the sensor(s) 344 may include a plurality of different types of devices and combine their outputs in order to provide motion information. For example, the sensor(s) 344 may use a combination of a multi-axis accelerometer and orientation sensors to provide the ability to compute positions in two-dimensional (2D) and/or three-dimensional (3D) coordinate systems.

In addition, the UE 302 includes a user interface 346 providing means for providing indications (e.g., audible and/or visual indications) to a user and/or for receiving user input (e.g., upon user actuation of a sensing device such a keypad, a touch screen, a microphone, and so on). Although not shown, the base station 304 and the network entity 306 may also include user interfaces.

Referring to the one or more processors 384 in more detail, in the downlink, IP packets from the network entity 306 may be provided to the processor 384. The one or more processors 384 may implement functionality for an RRC layer, a packet data convergence protocol (PDCP) layer, a radio link control (RLC) layer, and a medium access control (MAC) layer. The one or more processors 384 may provide RRC layer functionality associated with broadcasting of system information (e.g., master information block (MIB), system information blocks (SIBs)), RRC connection control (e.g., RRC connection paging, RRC connection establishment, RRC connection modification, and RRC connection release), inter-RAT mobility, and measurement configuration for UE measurement reporting; PDCP layer functionality associated with header compression/decompression, security (ciphering, deciphering, integrity protection, integrity verification), and handover support functions; RLC layer functionality associated with the transfer of upper layer PDUs, error correction through automatic repeat request (ARQ), concatenation, segmentation, and reassembly of RLC service data units (SDUs), re-segmentation of RLC data PDUs, and reordering of RLC data PDUs; and MAC layer functionality associated with mapping between logical channels and transport channels, scheduling information reporting, error correction, priority handling, and logical channel prioritization.

The transmitter 354 and the receiver 352 may implement Layer-1 (L1) functionality associated with various signal processing functions. Layer-1, which includes a physical (PHY) layer, may include error detection on the transport channels, forward error correction (FEC) coding/decoding of the transport channels, interleaving, rate matching, mapping onto physical channels, modulation/demodulation of physical channels, and MIMO antenna processing. The transmitter 354 handles mapping to signal constellations based on various modulation schemes (e.g., binary phase-shift keying (BPSK), quadrature phase-shift keying (QPSK), M-phase-shift keying (M-PSK), M-quadrature amplitude modulation (M-QAM)). The coded and modulated symbols may then be split into parallel streams. Each stream may then be mapped to an orthogonal frequency division multiplexing (OFDM) subcarrier, multiplexed with a reference signal (e.g., pilot) in the time and/or frequency domain, and then combined together using an inverse fast Fourier transform (IFFT) to produce a physical channel carrying a time domain OFDM symbol stream. The OFDM symbol stream is spatially precoded to produce multiple spatial streams. Channel estimates from a channel estimator may be used to determine the coding and modulation scheme, as well as for spatial processing. The channel estimate may be derived from a reference signal and/or channel condition feedback transmitted by the UE 302. Each spatial stream may then be provided to one or more different antennas 356. The transmitter 354 may modulate an RF carrier with a respective spatial stream for transmission.

At the UE 302, the receiver 312 receives a signal through its respective antenna(s) 316. The receiver 312 recovers information modulated onto an RF carrier and provides the information to the one or more processors 332. The transmitter 314 and the receiver 312 implement Layer-1 functionality associated with various signal processing functions. The receiver 312 may perform spatial processing on the information to recover any spatial streams destined for the UE 302. If multiple spatial streams are destined for the UE 302, they may be combined by the receiver 312 into a single OFDM symbol stream. The receiver 312 then converts the OFDM symbol stream from the time-domain to the frequency domain using a fast Fourier transform (FFT). The frequency domain signal comprises a separate OFDM symbol stream for each subcarrier of the OFDM signal. The symbols on each subcarrier, and the reference signal, are recovered and demodulated by determining the most likely signal constellation points transmitted by the base station 304. These soft decisions may be based on channel estimates computed by a channel estimator. The soft decisions are then decoded and de-interleaved to recover the data and control signals that were originally transmitted by the base station 304 on the physical channel. The data and control signals are then provided to the one or more processors 332, which implements Layer-3 (L3) and Layer-2 (L2) functionality.

In the uplink, the one or more processors 332 provides demultiplexing between transport and logical channels, packet reassembly, deciphering, header decompression, and control signal processing to recover IP packets from the core network. The one or more processors 332 are also responsible for error detection.

Similar to the functionality described in connection with the downlink transmission by the base station 304, the one or more processors 332 provides RRC layer functionality associated with system information (e.g., MIB, SIBs) acquisition, RRC connections, and measurement reporting; PDCP layer functionality associated with header compression/decompression, and security (ciphering, deciphering, integrity protection, integrity verification); RLC layer functionality associated with the transfer of upper layer PDUs, error correction through ARQ, concatenation, segmentation, and reassembly of RLC SDUs, re-segmentation of RLC data PDUs, and reordering of RLC data PDUs; and MAC layer functionality associated with mapping between logical channels and transport channels, multiplexing of MAC SDUs onto transport blocks (TBs), demultiplexing of MAC SDUs from TBs, scheduling information reporting, error correction through hybrid automatic repeat request (HARM), priority handling, and logical channel prioritization.

Channel estimates derived by the channel estimator from a reference signal or feedback transmitted by the base station 304 may be used by the transmitter 314 to select the appropriate coding and modulation schemes, and to facilitate spatial processing. The spatial streams generated by the transmitter 314 may be provided to different antenna(s) 316. The transmitter 314 may modulate an RF carrier with a respective spatial stream for transmission.

The uplink transmission is processed at the base station 304 in a manner similar to that described in connection with the receiver function at the UE 302. The receiver 352 receives a signal through its respective antenna(s) 356. The receiver 352 recovers information modulated onto an RF carrier and provides the information to the one or more processors 384.

In the uplink, the one or more processors 384 provides demultiplexing between transport and logical channels, packet reassembly, deciphering, header decompression, control signal processing to recover IP packets from the UE 302. IP packets from the one or more processors 384 may be provided to the core network. The one or more processors 384 are also responsible for error detection.

For convenience, the UE 302, the base station 304, and/or the network entity 306 are shown in FIGS. 3A, 3B, and 3C as including various components that may be configured according to the various examples described herein. It will be appreciated, however, that the illustrated components may have different functionality in different designs. In particular, various components in FIGS. 3A to 3C are optional in alternative configurations and the various aspects include configurations that may vary due to design choice, costs, use of the device, or other considerations. For example, in case of FIG. 3A, a particular implementation of UE 302 may omit the WWAN transceiver(s) 310 (e.g., a wearable device or tablet computer or PC or laptop may have Wi-Fi and/or Bluetooth capability without cellular capability), or may omit the short-range wireless transceiver(s) 320 (e.g., cellular-only, etc.), or may omit the satellite signal receiver 330, or may omit the sensor(s) 344, and so on. In another example, in case of FIG. 3B, a particular implementation of the base station 304 may omit the WWAN transceiver(s) 350 (e.g., a Wi-Fi “hotspot” access point without cellular capability), or may omit the short-range wireless transceiver(s) 360 (e.g., cellular-only, etc.), or may omit the satellite receiver 370, and so on. For brevity, illustration of the various alternative configurations is not provided herein, but would be readily understandable to one skilled in the art.

The various components of the UE 302, the base station 304, and the network entity 306 may be communicatively coupled to each other over data buses 334, 382, and 392, respectively. In an aspect, the data buses 334, 382, and 392 may form, or be part of, a communication interface of the UE 302, the base station 304, and the network entity 306, respectively. For example, where different logical entities are embodied in the same device (e.g., gNB and location server functionality incorporated into the same base station 304), the data buses 334, 382, and 392 may provide communication between them.

The components of FIGS. 3A, 3B, and 3C may be implemented in various ways. In some implementations, the components of FIGS. 3A, 3B, and 3C may be implemented in one or more circuits such as, for example, one or more processors and/or one or more ASICs (which may include one or more processors). Here, each circuit may use and/or incorporate at least one memory component for storing information or executable code used by the circuit to provide this functionality. For example, some or all of the functionality represented by blocks 310 to 346 may be implemented by processor and memory component(s) of the UE 302 (e.g., by execution of appropriate code and/or by appropriate configuration of processor components). Similarly, some or all of the functionality represented by blocks 350 to 388 may be implemented by processor and memory component(s) of the base station 304 (e.g., by execution of appropriate code and/or by appropriate configuration of processor components). Also, some or all of the functionality represented by blocks 390 to 398 may be implemented by processor and memory component(s) of the network entity 306 (e.g., by execution of appropriate code and/or by appropriate configuration of processor components). For simplicity, various operations, acts, and/or functions are described herein as being performed “by a UE,” “by a base station,” “by a network entity,” etc. However, as will be appreciated, such operations, acts, and/or functions may actually be performed by specific components or combinations of components of the UE 302, base station 304, network entity 306, etc., such as the processors 332, 384, 394, the transceivers 310, 320, 350, and 360, the memories 340, 386, and 396, the positioning component 342, 388, and 398, etc.

In some designs, the network entity 306 may be implemented as a core network component. In other designs, the network entity 306 may be distinct from a network operator or operation of the cellular network infrastructure (e.g., NG RAN 220 and/or 5GC 210/260). For example, the network entity 306 may be a component of a private network that may be configured to communicate with the UE 302 via the base station 304 or independently from the base station 304 (e.g., over a non-cellular communication link, such as WiFi).

FIG. 4 illustrates an example architecture of a transceiver 481 capable of implementing carrier aggregation, according to at least one aspect of the disclosure. The transceiver 481 may correspond to a WWAN transceiver 310 or a WLAN transceiver 320 of UE 302, or a WWAN transceiver 350 or a WLAN transceiver 360 of base station 304. The transceiver 481 may be coupled to first and second antennas 403 and 405. The antennas may correspond to antennas 316 or 326 of UE 302 or antennas 356 or 366 of base station 304.

The transceiver 481 includes receiver circuitry 441 and transmitter circuitry 451. The receiver circuitry 441 may correspond to receiver(s) 312, 322, 352, or 362 and the transmitter circuitry 451 may correspond to transmitter(s) 314, 324, 354, or 364. The receiver circuitry 441 is capable of implementing carrier aggregation. As such, in the example of FIG. 4, the receiver circuitry 441 includes two radios 411 and 423 coupled to the two antennas 403 and 405, respectively. Note that although FIG. 4 illustrates only two antennas 403 and 405 and two radios 411 and 423, as will be appreciated, there may be more than two antennas and two radios. The transmitter circuitry 451 may also be capable of implementing carrier aggregation similarly to the receiver circuitry 441, but this is not shown in FIG. 4 for the sake of simplicity.

A transceiver (e.g., transceiver 481) generally includes a modem (e.g., modem 435) and a radio (e.g., radio 411 or 423). The radio, broadly speaking, handles selection and conversion of the RF signals into the baseband or intermediate frequency and converts the RF signals to the digital domain. The modem is the remainder of the transceiver.

Referring to FIG. 4, radio 411 includes an amplifier 413, a mixer 415 (also referred to as a signal multiplier) for signal down conversion, a frequency synthesizer 417 (also referred to as an oscillator) that provides signals to the mixer 415, a baseband filter (BBF) 419, and an analog-to-digital converter (ADC) 421. Similarly, radio 423 includes an amplifier 425, a mixer 427, a frequency synthesizer 429, a BBF 431, and an ADC 433. The ADCs 421 and 433 are coupled to the signal combiner/signal selector 437 of the modem 435, which is coupled to the demodulator 439 of the modem 435. The demodulator 439 is coupled to a packet processor 443. The demodulator 439 and the packet processor 443 provide demodulated and processed single or multiple output signals to the communication controller and/or processing system (e.g., processor(s) 332 or 384).

Note that not every component illustrated in FIG. 4 is required for the operation of the system. For example, in direct RF-to-baseband conversion receivers, or any other direct conversion receivers, including certain software-defined radio (SDR) implementations, various components of the receiver circuitry 441 are not necessary, as is known in the art. In addition, while FIG. 4 illustrates a single modem 435 coupled to two radios 411 and 423, as will be appreciated, each radio 411 and 423 may be coupled to a different modem, and the receiver circuitry 441 would therefore include the same number of radios and modems. Further, while FIG. 4 illustrates integrated transmitter circuitry 451 and receiver circuitry 441, i.e., transceiver 481, in some implementations, a UE or base station may comprise a separate transmitter device and a separate receiver device.

As noted above, carrier aggregation is a technique whereby a UE (e.g., any of the UEs described herein) can receive and/or transmit on multiple carrier frequencies at the same time, thereby increasing downlink and uplink data rates. Thus, the UE may simultaneously utilize radio 411 to tune to one carrier frequency (e.g., the anchor carrier) and radio 423 to tune to a different carrier frequency (e.g., a secondary carrier). In addition, each radio 411 and 423 may be tunable to a plurality of different frequencies, one at a time.

Various frame structures may be used to support downlink and uplink transmissions between network nodes (e.g., base stations and UEs). FIG. 5 is a diagram 500 illustrating an example frame structure, according to aspects of the disclosure. Other wireless communications technologies may have different frame structures and/or different channels.

LTE, and in some cases NR, utilizes OFDM on the downlink and single-carrier frequency division multiplexing (SC-FDM) on the uplink. Unlike LTE, however, NR has an option to use OFDM on the uplink as well. OFDM and SC-FDM partition the system bandwidth into multiple (K) orthogonal subcarriers, which are also commonly referred to as tones, bins, etc. Each subcarrier may be modulated with data. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. The spacing between adjacent subcarriers may be fixed, and the total number of subcarriers (K) may be dependent on the system bandwidth. For example, the spacing of the subcarriers may be 15 kilohertz (kHz) and the minimum resource allocation (resource block) may be 12 subcarriers (or 180 kHz). Consequently, the nominal FFT size may be equal to 128, 256, 512, 1024, or 2048 for system bandwidth of 1.25, 2.5, 5, 10, or 20 megahertz (MHz), respectively. The system bandwidth may also be partitioned into subbands. For example, a subband may cover 1.08 MHz (i.e., 6 resource blocks), and there may be 1, 2, 4, 8, or 16 subbands for system bandwidth of 1.25, 2.5, 5, 10, or 20 MHz, respectively.

LTE supports a single numerology (subcarrier spacing (SCS), symbol length, etc.). In contrast, NR may support multiple numerologies (μ), for example, subcarrier spacings of 15 kHz (μ=0), 30 kHz (μ=1), 60 kHz (μ=2), 120 kHz (μ=3), and 240 kHz (μ=4) or greater may be available. In each subcarrier spacing, there are 14 symbols per slot. For 15 kHz SCS (μ=0), there is one slot per subframe, 10 slots per frame, the slot duration is 1 millisecond (ms), the symbol duration is 66.7 microseconds (μs), and the maximum nominal system bandwidth (in MHz) with a 4K FFT size is 50. For 30 kHz SCS (μ=1), there are two slots per subframe, 20 slots per frame, the slot duration is 0.5 ms, the symbol duration is 33.3 μs, and the maximum nominal system bandwidth (in MHz) with a 4K FFT size is 100. For 60 kHz SCS (μ=2), there are four slots per subframe, 40 slots per frame, the slot duration is 0.25 ms, the symbol duration is 16.7 μs, and the maximum nominal system bandwidth (in MHz) with a 4K FFT size is 200. For 120 kHz SCS (μ=3), there are eight slots per subframe, 80 slots per frame, the slot duration is 0.125 ms, the symbol duration is 8.33 μs, and the maximum nominal system bandwidth (in MHz) with a 4K FFT size is 400. For 240 kHz SCS (μ=4), there are 16 slots per subframe, 160 slots per frame, the slot duration is 0.0625 ms, the symbol duration is 4.17 μs, and the maximum nominal system bandwidth (in MHz) with a 4K FFT size is 800.

In the example of FIG. 5, a numerology of 15 kHz is used. Thus, in the time domain, a 10 ms frame is divided into 10 equally sized subframes of 1 ms each, and each subframe includes one time slot. In FIG. 5, time is represented horizontally (on the X axis) with time increasing from left to right, while frequency is represented vertically (on the Y axis) with frequency increasing (or decreasing) from bottom to top.

A resource grid may be used to represent time slots, each time slot including one or more time-concurrent resource blocks (RBs) (also referred to as physical RBs (PRBs)) in the frequency domain. The resource grid is further divided into multiple resource elements (REs). An RE may correspond to one symbol length in the time domain and one subcarrier in the frequency domain. In the numerology of FIG. 5, for a normal cyclic prefix, an RB may contain 12 consecutive subcarriers in the frequency domain and seven consecutive symbols in the time domain, for a total of 84 REs. For an extended cyclic prefix, an RB may contain 12 consecutive subcarriers in the frequency domain and six consecutive symbols in the time domain, for a total of 72 REs. The number of bits carried by each RE depends on the modulation scheme.

Some of the REs may carry reference (pilot) signals (RS). The reference signals may include positioning reference signals (PRS), tracking reference signals (TRS), phase tracking reference signals (PTRS), cell-specific reference signals (CRS), channel state information reference signals (CSI-RS), demodulation reference signals (DMRS), primary synchronization signals (PSS), secondary synchronization signals (SSS), synchronization signal blocks (SSBs), sounding reference signals (SRS), etc., depending on whether the illustrated frame structure is used for uplink or downlink communication. FIG. 5 illustrates example locations of REs carrying reference signals (labeled “R”).

A collection of resource elements (REs) that are used for transmission of PRS is referred to as a “PRS resource.” The collection of resource elements can span multiple PRBs in the frequency domain and ‘N’ (such as 1 or more) consecutive symbol(s) within a slot in the time domain. In a given OFDM symbol in the time domain, a PRS resource occupies consecutive PRBs in the frequency domain.

The transmission of a PRS resource within a given PRB has a particular comb size (also referred to as the “comb density”). A comb size ‘N’ represents the subcarrier spacing (or frequency/tone spacing) within each symbol of a PRS resource configuration. Specifically, for a comb size ‘N,’ PRS are transmitted in every Nth subcarrier of a symbol of a PRB. For example, for comb-4, for each symbol of the PRS resource configuration, REs corresponding to every fourth subcarrier (such as subcarriers 0, 4, 8) are used to transmit PRS of the PRS resource. Currently, comb sizes of comb-2, comb-4, comb-6, and comb-12 are supported for DL-PRS. FIG. 5 illustrates an example PRS resource configuration for comb-6 (which spans six symbols). That is, the locations of the shaded REs (labeled “R”) indicate a comb-6 PRS resource configuration.

Currently, a DL-PRS resource may span 2, 4, 6, or 12 consecutive symbols within a slot with a fully frequency-domain staggered pattern. A DL-PRS resource can be configured in any higher layer configured downlink or flexible (FL) symbol of a slot. There may be a constant energy per resource element (EPRE) for all REs of a given DL-PRS resource. The following are the frequency offsets from symbol to symbol for comb sizes 2, 4, 6, and 12 over 2, 4, 6, and 12 symbols. 2-symbol comb-2: {0, 1}; 4-symbol comb-2: {0, 1, 0, 1}; 6-symbol comb-2: {0, 1, 0, 1, 0, 1}; 12-symbol comb-2: {0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1}; 4-symbol comb-4: {0, 2, 1, 3}; 12-symbol comb-4: {0, 2, 1, 3, 0, 2, 1, 3, 0, 2, 1, 3}; 6-symbol comb-6: {0, 3, 1, 4, 2, 5}; 12-symbol comb-6: {0, 3, 1, 4, 2, 5, 0, 3, 1, 4, 2, 5}; and 12-symbol comb-12: {0, 6, 3, 9, 1, 7, 4, 10, 2, 8, 5, 11}.

A “PRS resource set” is a set of PRS resources used for the transmission of PRS signals, where each PRS resource has a PRS resource ID. In addition, the PRS resources in a PRS resource set are associated with the same TRP. A PRS resource set is identified by a PRS resource set ID and is associated with a particular TRP (identified by a TRP ID). In addition, the PRS resources in a PRS resource set have the same periodicity, a common muting pattern configuration, and the same repetition factor (such as “PRS-ResourceRepetitionFactor”) across slots. The periodicity is the time from the first repetition of the first PRS resource of a first PRS instance to the same first repetition of the same first PRS resource of the next PRS instance. The periodicity may have a length selected from 2{circumflex over ( )}μ*{4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 160, 320, 640, 1280, 2560, 5120, 10240} slots, with μ=0, 1, 2, 3. The repetition factor may have a length selected from {1, 2, 4, 6, 8, 16, 32} slots.

A PRS resource ID in a PRS resource set is associated with a single beam (or beam ID) transmitted from a single TRP (where a TRP may transmit one or more beams). That is, each PRS resource of a PRS resource set may be transmitted on a different beam, and as such, a “PRS resource,” or simply “resource,” also can be referred to as a “beam.” Note that this does not have any implications on whether the TRPs and the beams on which PRS are transmitted are known to the UE.

A “PRS instance” or “PRS occasion” is one instance of a periodically repeated time window (such as a group of one or more consecutive slots) where PRS are expected to be transmitted. A PRS occasion also may be referred to as a “PRS positioning occasion,” a “PRS positioning instance, a “positioning occasion,” “a positioning instance,” a “positioning repetition,” or simply an “occasion,” an “instance,” or a “repetition.”

A “positioning frequency layer” (also referred to simply as a “frequency layer”) is a collection of one or more PRS resource sets across one or more TRPs that have the same values for certain parameters. Specifically, the collection of PRS resource sets has the same subcarrier spacing and cyclic prefix (CP) type (meaning all numerologies supported for the physical downlink shared channel (PDSCH) are also supported for PRS), the same Point A, the same value of the downlink PRS bandwidth, the same start PRB (and center frequency), and the same comb-size. The Point A parameter takes the value of the parameter “ARFCN-ValueNR” (where “ARFCN” stands for “absolute radio-frequency channel number”) and is an identifier/code that specifies a pair of physical radio channel used for transmission and reception. The downlink PRS bandwidth may have a granularity of four PRBs, with a minimum of 24 PRBs and a maximum of 272 PRBs. Currently, up to four frequency layers have been defined, and up to two PRS resource sets may be configured per TRP per frequency layer.

The concept of a frequency layer is somewhat like the concept of component carriers and bandwidth parts (BWPs), but different in that component carriers and BWPs are used by one base station (or a macro cell base station and a small cell base station) to transmit data channels, while frequency layers are used by several (usually three or more) base stations to transmit PRS. A UE may indicate the number of frequency layers it can support when it sends the network its positioning capabilities, such as during an LTE positioning protocol (LPP) session. For example, a UE may indicate whether it can support one or four positioning frequency layers.

Note that the terms “positioning reference signal” and “PRS” generally refer to specific reference signals that are used for positioning in NR and LTE systems. However, as used herein, the terms “positioning reference signal” and “PRS” may also refer to any type of reference signal that can be used for positioning, such as but not limited to, PRS as defined in LTE and NR, TRS, PTRS, CRS, CSI-RS, DMRS, PSS, SSS, SSB, SRS, UL-PRS, etc. In addition, the terms “positioning reference signal” and “PRS” may refer to downlink or uplink positioning reference signals, unless otherwise indicated by the context. If needed to further distinguish the type of PRS, a downlink positioning reference signal may be referred to as a “DL-PRS,” and an uplink positioning reference signal (e.g., an SRS-for-positioning, PTRS) may be referred to as an “UL-PRS.” In addition, for signals that may be transmitted in both the uplink and downlink (e.g., DMRS, PTRS), the signals may be prepended with “UL” or “DL” to distinguish the direction. For example, “UL-DMRS” may be differentiated from “DL-DMRS.”

NR supports a number of cellular network-based positioning technologies, including downlink-based, uplink-based, and downlink-and-uplink-based positioning methods. Downlink-based positioning methods include observed time difference of arrival (OTDOA) in LTE, downlink time difference of arrival (DL-TDOA) in NR, and downlink angle-of-departure (DL-AoD) in NR. In an OTDOA or DL-TDOA positioning procedure, a UE measures the differences between the times of arrival (ToAs) of reference signals (e.g., positioning reference signals (PRS)) received from pairs of base stations, referred to as reference signal time difference (RSTD) or time difference of arrival (TDOA) measurements, and reports them to a positioning entity. More specifically, the UE receives the identifiers (IDs) of a reference base station (e.g., a serving base station) and multiple non-reference base stations in assistance data. The UE then measures the RSTD between the reference base station and each of the non-reference base stations. Based on the known locations of the involved base stations and the RSTD measurements, the positioning entity can estimate the UE's location.

For DL-AoD positioning, the positioning entity uses a beam report from the UE of received signal strength measurements of multiple downlink transmit beams to determine the angle(s) between the UE and the transmitting base station(s). The positioning entity can then estimate the location of the UE based on the determined angle(s) and the known location(s) of the transmitting base station(s).

Uplink-based positioning methods include uplink time difference of arrival (UL-TDOA) and uplink angle-of-arrival (UL-AoA). UL-TDOA is similar to DL-TDOA, but is based on uplink reference signals (e.g., sounding reference signals (SRS)) transmitted by the UE. For UL-AoA positioning, one or more base stations measure the received signal strength of one or more uplink reference signals (e.g., SRS) received from a UE on one or more uplink receive beams. The positioning entity uses the signal strength measurements and the angle(s) of the receive beam(s) to determine the angle(s) between the UE and the base station(s). Based on the determined angle(s) and the known location(s) of the base station(s), the positioning entity can then estimate the location of the UE.

Downlink-and-uplink-based positioning methods include enhanced cell-ID (E-CID) positioning and multi-round-trip-time (RTT) positioning (also referred to as “multi-cell RTT”). In an RTT procedure, an initiator (a base station or a UE) transmits an RTT measurement signal (e.g., a PRS or SRS) to a responder (a UE or base station), which transmits an RTT response signal (e.g., an SRS or PRS) back to the initiator. The RTT response signal includes the difference between the ToA of the RTT measurement signal and the transmission time of the RTT response signal, referred to as the reception-to-transmission (Rx-Tx) time difference. The initiator calculates the difference between the transmission time of the RTT measurement signal and the ToA of the RTT response signal, referred to as the transmission-to-reception (Tx-Rx) time difference. The propagation time (also referred to as the “time of flight”) between the initiator and the responder can be calculated from the Tx-Rx and Rx-Tx time differences. Based on the propagation time and the known speed of light, the distance between the initiator and the responder can be determined. For multi-RTT positioning, a UE performs an RTT procedure with multiple base stations to enable its location to be determined (e.g., using multilateration) based on the known locations of the base stations. RTT and multi-RTT methods can be combined with other positioning techniques, such as UL-AoA and DL-AoD, to improve location accuracy.

The E-CID positioning method is based on radio resource management (RRM) measurements. In E-CID, the UE reports the serving cell ID, the timing advance (TA), and the identifiers, estimated timing, and signal strength of detected neighbor base stations. The location of the UE is then estimated based on this information and the known locations of the base station(s).

To assist positioning operations, a location server (e.g., location server 230, LMF 270, SLP 272) may provide assistance data to the UE. For example, the assistance data may include identifiers of the base stations (or the cells/TRPs of the base stations) from which to measure reference signals, the reference signal configuration parameters (e.g., the number of consecutive positioning subframes, periodicity of positioning subframes, muting sequence, frequency hopping sequence, reference signal identifier, reference signal bandwidth, etc.), and/or other parameters applicable to the particular positioning method. Alternatively, the assistance data may originate directly from the base stations themselves (e.g., in periodically broadcasted overhead messages, etc.). In some cases, the UE may be able to detect neighbor network nodes itself without the use of assistance data.

In the case of an OTDOA or DL-TDOA positioning procedure, the assistance data may further include an expected RSTD value and an associated uncertainty, or search window, around the expected RSTD. In some cases, the value range of the expected RSTD may be +/−500 microseconds (μs). In some cases, when any of the resources used for the positioning measurement are in FR1, the value range for the uncertainty of the expected RSTD may be +/−32 μs. In other cases, when all of the resources used for the positioning measurement(s) are in FR2, the value range for the uncertainty of the expected RSTD may be +/−8 μs.

A location estimate may be referred to by other names, such as a position estimate, location, position, position fix, fix, or the like. A location estimate may be geodetic and comprise coordinates (e.g., latitude, longitude, and possibly altitude) or may be civic and comprise a street address, postal address, or some other verbal description of a location. A location estimate may further be defined relative to some other known location or defined in absolute terms (e.g., using latitude, longitude, and possibly altitude). A location estimate may include an expected error or uncertainty (e.g., by including an area or volume within which the location is expected to be included with some specified or default level of confidence).

There is a need for techniques to support the high accuracy (horizontal and vertical), low latency, network efficiency (scalability, reference signal overhead, etc.), and device efficiency (power consumption, complexity, etc.) requirements for commercial positioning uses cases (including general commercial use cases and specifically (I)IoT use cases). Referring to the accuracy requirement specifically, the accuracy of a location estimate depends on the accuracy of the positioning measurements (e.g., ToA, Rx-Tx time difference, RSTD, etc.) of received PRS, and the larger the bandwidth of the measured PRS, the more accurate the positioning measurements. One technique to increase the bandwidth of the measured PRS is multi-frequency layer PRS stitching. Multi-frequency layer PRS stitching enables positioning measurements using PRS that span contiguous component carriers. By spanning contiguous component carriers, the effective PRS bandwidth can be increased, as shown by diagram 600 in FIG. 6, resulting in increased positioning measurement accuracy. More specifically, a component carrier is currently defined as 100 MHz. By using three component carriers, as in the example of FIG. 6, the effective bandwidth of the measured PRS is 300 MHz. Note that when implementing multi-frequency layer PRS stitching, assumptions between the consecutive component carriers need to be defined (e.g., QCL, same antenna port, etc.) so that the effective PRS bandwidth can be increased (both for UL- and DL-PRS).

An aggregated PRS consists of a collection of PRS resources transmitted from the same TRP such that the UE may assume that the same antenna port is transmitted. Each PRS resource of an aggregated PRS is referred to as a PRS component. Each PRS component could be physically transmitted on different component carriers/bands/frequency layers, or just different bandwidths on the same band.

Bandwidth is the key resource for achieving higher accuracy in ToA estimation. However, network operators typically do not own single contiguous wide portions of bandwidth. Instead, fragmented bandwidths allocated in multiple carrier bands are more common. Accordingly, how to effectively utilize the aggregated bandwidth across disjoint bands is an important issue, and solving it will help to enable high precision positioning in 5G networks. In addition, being able to aggregate bandwidth across disjoint bands will also enable a quicker high precision position fix versus having to repeatedly perform measurements of multiple disjoint bands until the desired accuracy is achieved. In addition, it allows carriers to lower their costs by buying fragmented spectrum, and allows fragmented spectrum to potentially be used in verticals where high precision and low latency are required (e.g., automotive and IIOT use cases).

FIG. 7 is a graph 700 illustrating the power delay profile (PDP) of a multipath channel between a receiver device (e.g., any of the UEs or base stations described herein) and a transmitter device (e.g., any other of the UEs or base stations described herein), according to aspects of the disclosure. A PDP represents the intensity of an RF signal (e.g., PRS, SRS, etc.) received through a multipath channel as a function of time delay (the difference in travel time between multipath arrivals). Thus, the horizontal axis is in units of time (e.g., milliseconds) and the vertical axis is in units of signal strength (e.g., decibels). Note that a multipath channel is a channel between a transmitter and a receiver over which an RF signal follows multiple paths, or multipaths, due to transmission of the RF signal on multiple beams and/or to the propagation characteristics of the RF signal (e.g., reflection, refraction, etc.).

In the example of FIG. 7, the receiver detects/measures multiple (four) clusters of channel taps. Each channel tap represents a multipath that an RF signal (e.g., a PRS) followed between the transmitter and the receiver. That is, a channel tap represents the arrival of an RF signal on a multipath. Each cluster of channel taps indicates that the corresponding multipaths followed essentially the same path. There may be different clusters due to the RF signal being transmitted on different transmit beams (and therefore at different angles), or because of the propagation characteristics of RF signals (e.g., potentially following different paths due to reflections), or both.

All of the clusters of channel taps for a given RF signal represent the multipath channel (or simply channel) between the transmitter and receiver. Under the channel illustrated in FIG. 7, the receiver receives a first cluster of two RF signals on channel taps at time T1, a second cluster of five RF signals on channel taps at time T2, a third cluster of five RF signals on channel taps at time T3, and a fourth cluster of four RF signals on channel taps at time T4. In the example of FIG. 7, because the first cluster of RF signals at time T1 arrives first, it is assumed to correspond to the RF signal transmitted on the transmit beam aligned with the LOS, or the shortest, path. The time at which the first cluster arrives, i.e., time T1, is considered to be the ToA of the RF signal (e.g., a PRS). The third cluster at time T3 is comprised of the strongest RF signals, and may correspond to, for example, the RF signal transmitted on a transmit beam aligned with a non-line-of-sight (NLOS) path. Note that although FIG. 7 illustrates clusters of two to five channel taps, as will be appreciated, the clusters may have more or fewer than the illustrated number of channel taps.

There are issues with the time-domain based approach to determining the ToA of a PRS. For example, it is difficult to distinguish the main lobe from side lobes for channels with more than one channel tap. This is illustrated in FIG. 8, which is a graph 800 of example time domain waveforms for two separate bands. In graph 800, the vertical axis represents signal strength (in decibels) and the horizontal axis represents frequency. As can be seen, while the peak for Band 1 is easily distinguishable, the peak for the combination of Band 1 and Band 2 is not. In addition to time domain issues with identifying the earlies peak for accurate ToA estimation, phase coherence is also an issue.

The present disclosure proposes to address the issues in the frequency domain using a modified matrix pencil algorithm. A matrix pencil algorithm is a super-resolution signal processing technique. The algorithm has been successfully applied to ToA estimation for positioning using a single contiguous bandwidth. In the present disclosure, the matrix pencil algorithm is extended to allow joint-processing over multiple joint/disjoint component carriers (or frequency layers) for ToA estimation. The disclosed algorithm needs time alignment across the component carriers (or the knowledge of the clock offsets between them), but it does not need phase coherence across component carriers, meaning not all involved component carriers need to have the same phase. The effectiveness of the disclosed algorithm has been verified through simulation.

The following is an overview of a conventional matrix pencil algorithm. A matrix pencil is used to represent the PDP of an RF signal (as illustrated in FIG. 7) in the frequency domain. The frequency domain representation of the PDP of an RF signal using a matrix pencil is given as:

${X\lbrack k\rbrack} = {\sum\limits_{n = {1\mspace{14mu}\ldots\mspace{14mu} r}}{d_{n}{\exp\left( {{- j}\; 2\pi\; k\;\Delta\; f\;\tau_{n}} \right)}}}$

where k is the subcarrier index, n is the channel tap index, r is the total number of taps, j is a complex imaginary number, τ_(n) is the delay of the n-th path, do is the complex amplitude of the n-th path, and Δf is the subcarrier spacing.

The matrix representation is:

X=V _(L×r) ×d

where:

${V_{L \times r} = \begin{pmatrix} 1 & 1 & 1 & \text{…} & 1 \\ Z_{1} & Z_{2} & Z_{3} & \text{…} & Z_{r} \\ Z_{1}^{2} & Z_{2}^{2} & Z_{3}^{2} & \text{…} & Z_{r}^{2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ Z_{1}^{L­1} & Z_{2}^{L­1} & Z_{3}^{L­1} & \text{…} & Z_{r}^{L­1} \end{pmatrix}},{d = \begin{pmatrix} d_{1} \\ d_{2} \\ d_{3} \\ \vdots \\ d_{r} \end{pmatrix}}$

and where:

${z_{n} = {\exp\left( {{- j}\; 2{\pi\Delta}\; f\;\tau_{n}} \right)}},{z = \begin{pmatrix} Z_{1} \\ Z_{2} \\ Z_{3} \\ \vdots \\ Z_{r} \end{pmatrix}},{X = \left( {{X\lbrack 0\rbrack},{X\lbrack 1\rbrack},...\mspace{14mu},{X\left\lbrack {L - 1} \right\rbrack}} \right)^{T}}$

In the above equations, V_(L×r) is the Vandermonde Matrix.

The conventional matrix pencil algorithm is calculated as follows. Noise mitigation can be achieved by removing the weak component in the singular value decomposition (SVD) of the Hankel matrix of (X[0] ˜ X[L−1]) and then slicing the matrix into X _(e,1) and X _(e,2), as shown below. Specifically, the Hankel matrices X _(e,1) of (X[0] ˜ X[L−2]) and X _(e,2) of (X[1] ˜ X[L−1]) are determined, where L is the total number of subcarriers and u is the width of the matrix, which is larger than or equal to the total number of channel taps r:

${{\overset{¯}{X}}_{e,1} = \begin{pmatrix} {X\lbrack 0\rbrack} & {X\lbrack 1\rbrack} & {X\lbrack 2\rbrack} & \text{…} & {X\left\lbrack {u - 1} \right\rbrack} \\ {X\lbrack 1\rbrack} & {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & \text{…} & {X\lbrack u\rbrack} \\ {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & {X\lbrack 4\rbrack} & \text{…} & {X\left\lbrack {u + 1} \right\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\lbrack L - u - 1\rbrack} & {X\lbrack L - u\rbrack} & {X\lbrack L - u + 1\rbrack} & \text{…} & {X\left\lbrack {L - 2} \right\rbrack} \end{pmatrix}}{{\overset{¯}{X}}_{e,2} = \begin{pmatrix} {X\lbrack 1\rbrack} & {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & \text{…} & {X\lbrack u\rbrack} \\ {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & {X\lbrack 4\rbrack} & \text{…} & {X\left\lbrack {u + 1} \right\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\lbrack L - u\rbrack} & {X\lbrack L - u + 1\rbrack} & {X\left\lbrack {L - u + 2} \right\rbrack} & \text{…} & {X\left\lbrack {L - 1} \right\rbrack} \end{pmatrix}}$

These matrices can be represented as:

X _(e,1) =V _((L−u)×r) diag(d)V _(u×r) ^(T)

X _(e,2) =V _((L−u)×r) diag(d)diag(z)V _(u×r) ^(T)

These two matrices are then combined to form a generalized eigenvalue problem as:

X _(e,2) −λX _(e,1) =V _((L−u)×r) diag(d)(diag(z)−λI)V _(u×r) ^(T)

which can be solved by finding the eigen values of inv(X _(e,1)) X _(e,2), where inv(A) denotes the pseudo inverse of matrix A. As long as L−u≥r and u≥r the generalized eigen values in the above equation conforms to (z₁, z₂, . . . , z_(r)).

In contrast to the conventional matrix pencil algorithm described above, where L is the subcarrier index of contiguous subcarriers, the present disclosure describes a modified matrix pencil algorithm that can account for disjoint frequency bands. In the following, it is assumed that there are the two disjoint bands covering two sets of subcarriers X[0]˜X[M−1] and X[L]˜X[L+K−1], where L>=M.

In the disclosed matrix pencil algorithm, the Hankel matrices X _(e,1) of (X[0] ˜ X[M−2]) and X _(e,2) of (X[1] X[M−1]) for the first disjoint frequency band are determined as:

${{\overset{¯}{X}}_{e,1} = \begin{pmatrix} {X\lbrack 0\rbrack} & {X\lbrack 1\rbrack} & {X\lbrack 2\rbrack} & \text{…} & {X\left\lbrack {u - 1} \right\rbrack} \\ {X\lbrack 1\rbrack} & {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & \text{…} & {X\lbrack u\rbrack} \\ {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & {X\lbrack 4\rbrack} & \text{…} & {X\left\lbrack {u + 1} \right\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\left\lbrack {M - u - 1} \right\rbrack} & {X\left\lbrack {M - u} \right\rbrack} & {X\left\lbrack {M - u + 1} \right\rbrack} & \text{…} & {X\left\lbrack {M - 2} \right\rbrack} \end{pmatrix}}{{\overset{¯}{X}}_{e,2} = \begin{pmatrix} {X\lbrack 1\rbrack} & {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & \text{…} & {X\lbrack u\rbrack} \\ {X\lbrack 2\rbrack} & {X\lbrack 3\rbrack} & {X\lbrack 4\rbrack} & \text{…} & {X\left\lbrack {u + 1} \right\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\left\lbrack {M - u} \right\rbrack} & {X\left\lbrack {M - u + 1} \right\rbrack} & {X\left\lbrack {M - u + 2} \right\rbrack} & \text{…} & {X\left\lbrack {M - 1} \right\rbrack} \end{pmatrix}}$

These matrices can be represented as follows:

X _(e,1) =V _((M−u)×r) diag(d)V _(k×u) ^(T)

X _(e,2) =V _((M−u)×r) diag(d)diag(z)V _(k×u) ^(T)

These matrices can then be combined as:

X _(e,2) −λX _(e,1) =V _((M−u)×r) diag(d)(diag(z)−λI)V _(k×u) ^(T)

For the second disjoint frequency band, the variable ϕ is defined as a complex factor accounting for the unknown phase difference between the measurements on the two disjoint bands. The Hankel matrices Y _(e,1) of (X[L] ˜ X[L+K−2]) and Y _(e,2) of (X[L+1]X[L+K−1]) for the second disjoint frequency band are determined as:

${\overset{¯}{Y}}_{e,1} = {\begin{pmatrix} {X\lbrack L\rbrack} & {X\left\lbrack {L + 1} \right\rbrack} & {X\left\lbrack {L + 2} \right\rbrack} & \text{…} & {X\lbrack L + u - 1\rbrack} \\ {X\lbrack L + 1\rbrack} & {X\left\lbrack {L + 2} \right\rbrack} & {X\left\lbrack {L + 3} \right\rbrack} & \text{…} & {X\lbrack L + u\rbrack} \\ {X\lbrack L + 2\rbrack} & {X\left\lbrack {L + 3} \right\rbrack} & {X\left\lbrack {L + 4} \right\rbrack} & \text{…} & {X\lbrack L + u + 1\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\left\lbrack {L + K - u - 1} \right\rbrack} & {X\lbrack L + K - u\rbrack} & {X\lbrack L + K - u + 1\rbrack} & \text{…} & {X\left\lbrack {L + K - 2} \right\rbrack} \end{pmatrix} \times \phi}$ ${\overset{¯}{Y}}_{e,2} = {\begin{pmatrix} {X\lbrack L + 1\rbrack} & {X\lbrack L + 2\rbrack} & {X\left\lbrack {L + 3} \right\rbrack} & \text{…} & {X\lbrack L + u\rbrack} \\ {X\lbrack L + 2\rbrack} & {X\lbrack L + 3\rbrack} & {X\left\lbrack {L + 4} \right\rbrack} & \text{…} & {X\left\lbrack {L + u + 1} \right\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\lbrack L + K - u\rbrack} & {X\left\lbrack {L + K - u + 1} \right\rbrack} & {X\left\lbrack {L + K - u + 2} \right\rbrack} & \text{…} & {X\lbrack L + K - 1\rbrack} \end{pmatrix} \times \phi}$

These matrices can be represented as:

Y _(e,1) =V _((K−u)×r)×ϕ×diag(z)^(L)×diag(d)V _(u×r) ^(T)

Y _(e,2) =V _((K−u)×r)×ϕ×diag(z)^(L) diag(d)diag(z)V _(u×r) ^(T)

These matrices can then be combined as:

Y _(e,2) −λY _(e,1) =V _((K−u)×r)×ϕ×diag(z)^(L) diag(d)(diag(z)−λI)V _(u×r) ^(T)

The Hankel matrices X _(e,1), X _(e,2), Y _(e,1), and Y _(e,2) for the two disjoint frequency bands can then be combined as:

${\begin{bmatrix} {\overset{¯}{X}}_{e,2} \\ {\overset{¯}{Y}}_{e,2} \end{bmatrix} - {\lambda\begin{bmatrix} {\overset{¯}{X}}_{e,1} \\ {\overset{¯}{Y}}_{e,1} \end{bmatrix}}} = {\begin{bmatrix} V_{{({M - u})} \times r} \\ {V_{{({K - u})} \times r} \times \phi \times {{diag}(z)}^{L}} \end{bmatrix}{{diag}(d)}\left( {{{diag}(z)} - {\lambda\; I}} \right)V_{u \times r}^{T}}$

Noise reduction can be processed as before on the concatenated Hankel matrix. This can be expanded as follows:

$D = {\begin{bmatrix} V_{{({M - u})} \times r} \\ {V_{{({K - u})} \times r} \times \phi \times {{diag}(z)}^{L}} \end{bmatrix} = \begin{pmatrix} 1 & 1 & 1 & \ldots & 1 \\ z_{1} & z_{2} & z_{3} & \ldots & z_{r} \\ z_{1}^{2} & z_{2}^{2} & z_{3}^{2} & \ldots & z_{r}^{2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ z_{1}^{M - u - 1} & z_{2}^{M - u - 1} & z_{3}^{M - u - 1} & \cdots & z_{r}^{M - u - 1} \\ {z_{1}^{L}\phi} & {z_{2}^{L}\phi} & {z_{3}^{L}\phi} & \cdots & {z_{r}^{L}\phi} \\ {z_{1}^{L + 1}\phi} & {z_{2}^{L + 1}\phi} & {z_{3}^{L + 1}\phi} & \cdots & {z_{r}^{L + 1}\phi} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {z_{1}^{L + K - u - 1}\phi} & {z_{2}^{{{L++}K} - u - 1}\phi} & {z_{3}^{L + K - u - 1}\phi} & \cdots & {z_{r}^{L + K - u}\phi} \end{pmatrix}}$

The generalized eigen values in the above equation conform to (z₁, z₂, . . . , z_(r)) if D has rank r, which is usually the case when (M−u)+(K−u)≥r, considering a generalized Vandermonde matrix-like structure of D.

Although the above algorithm has been described for two disjoint frequency bands, as will be appreciated, extending the algorithm to more than two disjoint bands is straightforward.

FIG. 9 is a graph 900 illustrating example simulation results for the disclosed matrix pencil algorithm for an indoor factory (InF) scenario, according to aspects of the disclosure. In the graph 900, the vertical axis represents the cumulative density function (CDF) and the horizontal axis represents horizontal positioning error (in meters). The rightmost plot is for a 50 MHz band, the next plot is for two 50 MHz bands separated by another 50 MHz band, the middle plot is for a single 100 MHz band, the next plot is for two 100 MHz bands separated by another 100 MHz band, and the leftmost plot is for a 200 MHz band. As can be seen, the horizontal positioning accuracy improves with aggregated bandwidth across disjoint bands.

FIGS. 10A and 10B illustrate an example processing flow 1000 of the disclosed matrix pencil algorithm, according to aspects of the disclosure. At the first stage, the receiver (e.g., a UE) performs channel frequency response (CFR) measurements for each of n frequency layers on which an RF signal (e.g., a PRS) is received. The n frequency layers may be contiguous or non-contiguous. For example, each frequency layer may be disjoint from other frequency layers, or different groups of frequency layers may be contiguous with each other but disjoint from other groups of frequency layers.

The frequency domain samples generated at the first (1) stage are represented as X[k_(n)] . . . X[k_(n)+L_(n)−1] and used, at the second (2) stage, to construct a Hankel matrix X ^(n) for each frequency layer. The matrix form of each X ^(n) is represented as:

${\overset{¯}{X}}^{n}\begin{pmatrix} {X\left\lbrack k_{n} \right\rbrack} & {X\left\lbrack {k_{n} + 1} \right\rbrack} & {X\left\lbrack {k_{n} + 2} \right\rbrack} & \ldots & {X\left\lbrack {k_{n} + u - 1} \right\rbrack} \\ {X\left\lbrack {k_{n} + 1} \right\rbrack} & {X\left\lbrack {k_{n} + 2} \right\rbrack} & {X\left\lbrack {k_{n} + 3} \right\rbrack} & \ldots & {X\left\lbrack {k_{n} + u} \right\rbrack} \\ {X\left\lbrack {k_{n} + 2} \right\rbrack} & {X\left\lbrack {k_{n} + 3} \right\rbrack} & {X\left\lbrack {k_{n} + 4} \right\rbrack} & \ldots & {X\left\lbrack {k_{n} + u - 1} \right\rbrack} \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ {X\left\lbrack {k_{n} + L_{n} - u} \right\rbrack} & {X\left\lbrack {k_{n} + L_{n} - u + 1} \right\rbrack} & {X\left\lbrack {k_{n} + L_{n} - u + 2} \right\rbrack} & \ldots & {X\left\lbrack {k_{n} + L_{n} - 1} \right\rbrack} \end{pmatrix}$

where u is selected such that L_(n)≥u≥r and Σ(L_(n)−u)≥r.

After the second (2) stage, SVD denoising can be performed on X_(e,1) ^(n) and X_(e,2) ^(n). SVD denoising can also be performed jointly on the stacked matrix of [X ¹; X ²; . . . X ^(n)]. The result is then decomposed into {circumflex over (X)}¹, {circumflex over (X)}², . . . , {circumflex over (X)}^(n).

The results of the SVD denoising, {circumflex over (X)}^(n), are passed to the third (3) stage, where, for each frequency layer, the Hankel matrices X_(e,1) ^(n) and X_(e,2) ^(n) are built from slicing {circumflex over (X)}^(n). In an aspect, rather than perform SVD denoising before the third (3) stage, the SVD denoising can be performed after the third (3) stage.

At the fourth (4) stage, the Hankel matrices X_(e,1) ^(n) and X_(e,2) ^(n) for each frequency layer are stacked in order into matrices X_(e,1) and X_(e,2), respectively. At the fifth (5) stage, the eigenvalues z₁, z₂, . . . of inv(X_(e,1))X_(e,2) are calculated. Subsequently, as an optional operation, values of z_(i) with |abs(z_(i))−1|>ϵ are removed. For example, E may be 0.5.

At the sixth (6) stage,

$\tau_{i} = {- \frac{\ln\left( z_{i} \right)}{2\pi\;\Delta\; f}}$

is computed. At the seventh (7) stage, the smallest value of τ_(i) is considered as the first ToA of the RF signal received on the n frequency layers.

The disclosed modified matrix pencil algorithm is agnostic to phase changes across frequency layers but not timing differences across the frequency layers. As such, a time alignment procedure is performed. More specifically, a UE may be configured with multiple frequency layers. In each frequency layer, there may be multiple TRPs, and each TRP may have multiple resources. The ToA estimate procedure is carried out for each TRP.

Under certain conditions, the UE cannot measure the resources in different frequency layers concurrently (e.g., for devices with limited bandwidth support). As a result, the timing measurement on each frequency layer is performed in a time-division multiplexing (TDM) fashion, as shown in FIG. 11. Specifically, FIG. 11 is a diagram 1100 illustrating an example of an RF signal (e.g., a PRS) that is received on three disjoint frequency layers that are measured in consecutive, not concurrent, time periods. In diagram 1100, the vertical axis represents frequency and the horizontal axis represents time.

When the resources used for joint processing ToA estimation are measured at different time instances (as illustrated in FIG. 11), the time alignment across the measurements on the resources needs to be adjusted first. FIG. 12 is a processing flow 1200 illustrating a portion of the disclosed matrix pencil algorithm illustrated in FIGS. 10A and 10B, according to aspects of the disclosure. As shown in FIG. 12, a time alignment processing block 1210 can be added to the processing flow illustrated in FIGS. 10A and 10B after the CFR measurement stage (the first (1) stage). The processing flow 1200 can then continue as illustrated in FIGS. 10A and 10B. More specifically, the timing adjustment can be estimated between the measurements on resources from different frequency layers.

The estimated time shift can then be used to compensate each measurement in the frequency domain through phase ramping (i.e., multiplying tone k with exp (j2πkΔfd) for delay adjustment d).

Referring now to SVD denoising in greater detail, SVD denoising starts with SVD decomposition on X ^(n). Specifically, X ^(n)=UDV*, where D=diag(λ₁, λ₂, . . . , λ_(p)), λ₁≥λ₂≥ . . . , ≥λ_(p)≥0, and V* denotes the Hermitian of V. The components with weaker singular values of λ_(i) are removed from X ^(n) as follows: X ^(n)=U[1:d] diag(λ₁, λ₂, . . . , λ_(d))V[1:d]*, where U[1:d] and V [1:d] denote the first d columns of U and V.

There are various estimation algorithms that can be performed on the number of signals to determine d. One example is the minimum description length (MDL) algorithm, which can be represented as:

${{MDL}(k)} = {{- {\log\left( \frac{\prod\limits_{i = {k + 1}}^{p}\lambda_{i}^{1/{({p - k})}}}{\frac{1}{p - k}{\sum\limits_{i = {k + 1}}^{p}\lambda_{i}}} \right)}^{{({p - k})}N}} + {\frac{1}{2}{k\left( {{2p} - k} \right)}\log N}}$

where d=minimizer of MDL(k) for k=0, . . . , p, and where p is the number of singular values (λ_(i)) and Nis the number of tones used in constructing X ^(n).

Another example is the Akiake information criterion (AIC) algorithm, which can be represented as:

${{AIC}(k)} = {{{- 2}{\log\left( \frac{\prod\limits_{i = {k + 1}}^{p}\lambda_{i}^{1/{({p - k})}}}{\frac{1}{p - k}{\sum\limits_{i = {k + 1}}^{p}\lambda_{i}}} \right)}} + {2{k\left( {{2p} - k} \right)}}}$

where d=minimizer of AIC(k) for k=0, . . . , p, where p is the number of singular values (λ_(i)) and Nis the number of tones used in constructing X ^(n).

FIG. 13 illustrates an example method 1300 of wireless communication, according to aspects of the disclosure. In an aspect, method 1300 may be performed by a network node (e.g., any of the UEs or base stations described herein).

At 1310, the network node receives a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other. In an aspect, where the network node is a UE, operation 1310 may be performed by the one or more WWAN transceivers 310, the one or more processors 332, memory 340, and/or positioning component 342, any or all of which may be considered means for performing this operation. In an aspect, where the network node is a base station, operation 1310 may be performed by the one or more WWAN transceivers 350, the one or more processors 384, memory 386, and/or positioning component 388, any or all of which may be considered means for performing this operation.

At 1320, the network node determines a ToA of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments. In an aspect, where the network node is a UE, operation 1320 may be performed by the one or more WWAN transceivers 310, the one or more processors 332, memory 340, and/or positioning component 342, any or all of which may be considered means for performing this operation. In an aspect, where the network node is a base station, operation 1320 may be performed by the one or more WWAN transceivers 350, the one or more processors 384, memory 386, and/or positioning component 388, any or all of which may be considered means for performing this operation.

As will be appreciated, a technical advantage of the method 1300 is improved ToA estimation by enabling the network node to measure PRS across a larger (disjoint) bandwidth. Another technical advantage is that the method 1300 does not require phase coherence across the measurements on each disjoint bandwidth.

In the detailed description above it can be seen that different features are grouped together in examples. This manner of disclosure should not be understood as an intention that the example clauses have more features than are explicitly mentioned in each clause. Rather, the various aspects of the disclosure may include fewer than all features of an individual example clause disclosed. Therefore, the following clauses should hereby be deemed to be incorporated in the description, wherein each clause by itself can stand as a separate example. Although each dependent clause can refer in the clauses to a specific combination with one of the other clauses, the aspect(s) of that dependent clause are not limited to the specific combination. It will be appreciated that other example clauses can also include a combination of the dependent clause aspect(s) with the subject matter of any other dependent clause or independent clause or a combination of any feature with other dependent and independent clauses. The various aspects disclosed herein expressly include these combinations, unless it is explicitly expressed or can be readily inferred that a specific combination is not intended (e.g., contradictory aspects, such as defining an element as both an insulator and a conductor). Furthermore, it is also intended that aspects of a clause can be included in any other independent clause, even if the clause is not directly dependent on the independent clause.

Implementation examples are described in the following numbered clauses:

Clause 1. A method of wireless communication performed by a network node, comprising: receiving a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determining a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.

Clause 2. The method of clause 1, wherein the plurality of disjoint bandwidth segments comprises a plurality of disjoint component carriers or a plurality of frequency layers.

Clause 3. The method of any of clauses 1 to 2, wherein: the plurality of disjoint bandwidth segments comprises a plurality of groups of bandwidth segments, bandwidth segments within each of the plurality of groups of bandwidth segments are contiguous in frequency, and the plurality of groups of bandwidth segments are disjoint in frequency.

Clause 4. The method of any of clauses 1 to 3, wherein determining the ToA of the reference signal comprises: determining the ToA of the reference signal based on a modified matrix pencil algorithm.

Clause 5. The method of clause 4, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm comprises: determining a plurality of channel frequency response (CFR) measurements corresponding to the plurality of disjoint bandwidth segments.

Clause 6. The method of clause 5, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining a first plurality of Hankel matrices corresponding to the plurality of disjoint bandwidth segments based on the plurality of CFR measurements corresponding to the plurality of disjoint bandwidth segments.

Clause 7. The method of clause 6, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: performing singular value decomposition (SVD) denoising on each of the first plurality of Hankel matrices.

Clause 8. The method of any of clauses 6 to 7, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining a second plurality of Hankel matrices corresponding to the plurality of disjoint bandwidth segments based on slicing the first plurality of Hankel matrices.

Clause 9. The method of clause 8, wherein slicing the first plurality of Hankel matrices comprises: determining a plurality of the second plurality of Hankel matrices for each of the first plurality of Hankel matrices.

Clause 10. The method of any of clauses 8 to 9, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: performing SVD denoising on each of the second plurality of Hankel matrices.

Clause 11. The method of any of clauses 8 to 10, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: stacking the second plurality of Hankel matrices to generate a plurality of stacked matrices.

Clause 12. The method of clause 11, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining eigenvalues based on the plurality of stacked matrices.

Clause 13. The method of clause 12, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining a plurality of ToAs corresponding to the plurality of disjoint bandwidth segments based on the eigenvalues.

Clause 14. The method of clause 13, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining the ToA of the reference signal as a ToA of the plurality of ToAs having a smallest value.

Clause 15. The method of any of clauses 1 to 14, further comprising: measuring the plurality of time and frequency resources across the plurality of disjoint bandwidth segments at different times; and performing a time alignment procedure on the plurality of time and frequency resources to time align measurements of the plurality of time and frequency resources.

Clause 16. The method of any of clauses 1 to 15, wherein: the network node is a user equipment (UE), and the reference signal is a downlink positioning reference signal (DL-PRS) transmitted by a base station.

Clause 17. The method of any of clauses 1 to 15, wherein: the network node is a base station, and the reference signal is a sounding reference signal (SRS) transmitted by a UE.

Clause 18. An apparatus comprising a memory, at least one transceiver, and at least one processor communicatively coupled to the memory and the at least one transceiver, the memory, the at least one transceiver, and the at least one processor configured to perform a method according to any of clauses 1 to 17.

Clause 19. An apparatus comprising means for performing a method according to any of clauses 1 to 17.

Clause 20. A non-transitory computer-readable medium storing computer-executable instructions, the computer-executable comprising at least one instruction for causing a computer or processor to perform a method according to any of clauses 1 to 17.

Those of skill in the art will appreciate that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

Further, those of skill in the art will appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an ASIC, a field-programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The methods, sequences and/or algorithms described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in random access memory (RAM), flash memory, read-only memory (ROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An example storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal (e.g., UE). In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.

In one or more example aspects, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

While the foregoing disclosure shows illustrative aspects of the disclosure, it should be noted that various changes and modifications could be made herein without departing from the scope of the disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the aspects of the disclosure described herein need not be performed in any particular order. Furthermore, although elements of the disclosure may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated. 

What is claimed is:
 1. A method of wireless communication performed by a network node, comprising: receiving a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determining a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.
 2. The method of claim 1, wherein the plurality of disjoint bandwidth segments comprises a plurality of disjoint component carriers or a plurality of frequency layers.
 3. The method of claim 1, wherein: the plurality of disjoint bandwidth segments comprises a plurality of groups of bandwidth segments, bandwidth segments within each of the plurality of groups of bandwidth segments are contiguous in frequency, and the plurality of groups of bandwidth segments are disjoint in frequency.
 4. The method of claim 1, wherein determining the ToA of the reference signal comprises: determining the ToA of the reference signal based on a modified matrix pencil algorithm.
 5. The method of claim 4, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm comprises: determining a plurality of channel frequency response (CFR) measurements corresponding to the plurality of disjoint bandwidth segments.
 6. The method of claim 5, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining a first plurality of Hankel matrices corresponding to the plurality of disjoint bandwidth segments based on the plurality of CFR measurements corresponding to the plurality of disjoint bandwidth segments.
 7. The method of claim 6, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: performing singular value decomposition (SVD) denoising on each of the first plurality of Hankel matrices.
 8. The method of claim 6, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining a second plurality of Hankel matrices corresponding to the plurality of disjoint bandwidth segments based on slicing the first plurality of Hankel matrices.
 9. The method of claim 8, wherein slicing the first plurality of Hankel matrices comprises: determining a plurality of the second plurality of Hankel matrices for each of the first plurality of Hankel matrices.
 10. The method of claim 8, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: performing SVD denoising on each of the second plurality of Hankel matrices.
 11. The method of claim 8, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: stacking the second plurality of Hankel matrices to generate a plurality of stacked matrices.
 12. The method of claim 11, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining eigenvalues based on the plurality of stacked matrices.
 13. The method of claim 12, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining a plurality of ToAs corresponding to the plurality of disjoint bandwidth segments based on the eigenvalues.
 14. The method of claim 13, wherein determining the ToA of the reference signal based on the modified matrix pencil algorithm further comprises: determining the ToA of the reference signal as a ToA of the plurality of ToAs having a smallest value.
 15. The method of claim 1, further comprising: measuring the plurality of time and frequency resources across the plurality of disjoint bandwidth segments at different times; and performing a time alignment procedure on the plurality of time and frequency resources to time align measurements of the plurality of time and frequency resources.
 16. The method of claim 1, wherein: the network node is a user equipment (UE), and the reference signal is a downlink positioning reference signal (DL-PRS) transmitted by a base station.
 17. The method of claim 1, wherein: the network node is a base station, and the reference signal is a sounding reference signal (SRS) transmitted by a UE.
 18. A network node, comprising: a memory; at least one transceiver; and at least one processor communicatively coupled to the memory and the at least one transceiver, the at least one processor configured to: receive, via the at least one transceiver, a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determine a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.
 19. The network node of claim 18, wherein the plurality of disjoint bandwidth segments comprises a plurality of disjoint component carriers or a plurality of frequency layers.
 20. The network node of claim 18, wherein: the plurality of disjoint bandwidth segments comprises a plurality of groups of bandwidth segments, bandwidth segments within each of the plurality of groups of bandwidth segments are contiguous in frequency, and the plurality of groups of bandwidth segments are disjoint in frequency.
 21. The network node of claim 18, wherein the at least one processor configured to determine the ToA of the reference signal comprises the at least one processor configured to: determine the ToA of the reference signal based on a modified matrix pencil algorithm.
 22. The network node of claim 21, wherein the at least one processor configured to determine the ToA of the reference signal based on the modified matrix pencil algorithm comprises the at least one processor configured to: determine a plurality of channel frequency response (CFR) measurements corresponding to the plurality of disjoint bandwidth segments.
 23. The network node of claim 22, wherein the at least one processor configured to determine the ToA of the reference signal based on the modified matrix pencil algorithm comprises the at least one processor configured to: determine a first plurality of Hankel matrices corresponding to the plurality of disjoint bandwidth segments based on the plurality of CFR measurements corresponding to the plurality of disjoint bandwidth segments.
 24. The network node of claim 23, wherein the at least one processor configured to determine the ToA of the reference signal based on the modified matrix pencil algorithm comprises the at least one processor configured to: perform singular value decomposition (SVD) denoising on each of the first plurality of Hankel matrices.
 25. The network node of claim 23, wherein the at least one processor configured to determine the ToA of the reference signal based on the modified matrix pencil algorithm comprises the at least one processor configured to: determine a second plurality of Hankel matrices corresponding to the plurality of disjoint bandwidth segments based on slicing the first plurality of Hankel matrices.
 26. The network node of claim 25, wherein the at least one processor configured to slice the first plurality of Hankel matrices comprises the at least one processor configured to: determine a plurality of the second plurality of Hankel matrices for each of the first plurality of Hankel matrices.
 27. The network node of claim 25, wherein the at least one processor configured to determine the ToA of the reference signal based on the modified matrix pencil algorithm comprises the at least one processor configured to: perform SVD denoising on each of the second plurality of Hankel matrices.
 28. The network node of claim 25, wherein the at least one processor configured to determine the ToA of the reference signal based on the modified matrix pencil algorithm comprises the at least one processor configured to: stack the second plurality of Hankel matrices to generate a plurality of stacked matrices.
 29. A network node, comprising: means for receiving a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and means for determining a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments.
 30. A non-transitory computer-readable medium storing computer-executable instructions that, when executed by a network node, cause the network node to: receive a reference signal comprising a plurality of time and frequency resources, the plurality of time and frequency resources spanning a plurality of disjoint bandwidth segments, the plurality of disjoint bandwidth segments being time aligned or having a known time offset with respect to each other; and determine a time of arrival (ToA) of the reference signal based on jointly processing the plurality of time and frequency resources of the reference signal across the plurality of disjoint bandwidth segments. 